Polyhedral Combinatorics

Robert D. Carr () and Goran Konjevod ()
Additional contact information
Robert D. Carr: Sandia National Laboratories
Goran Konjevod: Arizona State University

Chapter Chapter 2 in Tutorials on Emerging Methodologies and Applications in Operations Research, 2005, pp 2-1-2-46 from Springer

Abstract: Abstract Polyhedral combinatorics is a rich mathematical subject motivated by integer and linear programming. While not exhaustive, this survey covers a variety of interesting topics, so let’s get right to it!

Keywords: combinatorial optimization; integer programming; linear programming; polyhedron; relaxation; separation; duality; compact optimization; projection; lifting; dynamic programming; total dual integrality; integrality gap; approximation algorithms (search for similar items in EconPapers)
Date: 2005
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:isochp:978-0-387-22827-3_2

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

DOI: 10.1007/0-387-22827-6_2

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().