Mixed Integer Programming Computation

Andrea Lodi ()
Additional contact information
Andrea Lodi: DEIS, University of Bologna

Chapter Chapter 16 in 50 Years of Integer Programming 1958-2008, 2010, pp 619-645 from Springer

Abstract: Abstract The first 50 years of Integer and Mixed-Integer Programming have taken us to a very stable paradigm for solving problems in a reliable and effective way. We run over these 50 exciting years by showing some crucial milestones and we highlight the building blocks that are making nowadays solvers effective from both a performance and an application viewpoint. Finally, we show that a lot of work must still be done for improving the solvers and extending their modeling capability.

Keywords: Mixed Integer; Travel Salesman Problem; Linear Programming Relaxation; Mixed Integer Programming Problem; Clique Inequality (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-68279-0_16

Ordering information: This item can be ordered from
http://www.springer.com/9783540682790

DOI: 10.1007/978-3-540-68279-0_16

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().