Polyhedral Approaches to Mixed Integer Linear Programming

Michele Conforti (), Gérard Cornuéjols () and Giacomo Zambelli ()
Additional contact information
Michele Conforti: Università di Padova
Gérard Cornuéjols: Carnegie Mellon University
Giacomo Zambelli: Università di Padova

Chapter Chapter 11 in 50 Years of Integer Programming 1958-2008, 2010, pp 343-385 from Springer

Abstract: Abstract This survey presents tools from polyhedral theory that are used in integer programming. It applies them to the study of valid inequalities for mixed integer linear sets, such as Gomory’s mixed integer cuts.

Keywords: Mixed Integer; Valid Inequality; Basic Feasible Solution; Recession Cone; Simplex Tableau (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_11

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

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

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 ().