Showing 1 - 5 results of 5 for search 'Wolsey, Laurence A.' Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • Author
  • Wolsey, Laurence A.
Showing 1 - 5 results of 5 for search 'Wolsey, Laurence A.', query time: 0.03s Refine Results
  1. 1
    Production planning by mixed integer programming /

    Production planning by mixed integer programming / by 435775 Pochet, Yves, Wolsey, Laurence A.

    Published 2006
  2. 2
    Optimal Trees

    Optimal Trees by Magnanti, Thomas L., Wolsey, Laurence A.

    Published 2004
    Get full text
    Working Paper
  3. 3
    Relaxation methods for pure and mixed integer programming problems

    Relaxation methods for pure and mixed integer programming problems by Gorry, George Anthony, Shapiro, Jeremy F., Wolsey, Laurence A.

    Published 2009
    Get full text
    Working Paper
  4. 4
    Optimizing Constrained Subtrees of Trees

    Optimizing Constrained Subtrees of Trees by Aghezzaf, El Houssaine, Magnanti, Thomas L., Wolsey, Laurence A.

    Published 2004
    Get full text
    Working Paper
  5. 5
    Economic Lot-Sizing with Start-up Costs:  The Convex Hull

    Economic Lot-Sizing with Start-up Costs: The Convex Hull by Van Hoesel, C. P. M., Wagelmans, Albert, Wolsey, Laurence A.

    Published 2004
    Get full text
    Working Paper

Search Tools:

  • RSS Feed
  • Email Search

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs