Polyhedral Combinatorics in Combinatorial Optimization |
| |
| Authors: | AMH Gerards AWJ Kolen |
| |
| Institution: | Department of Econometrics Catholic University of Tilburg P.O. Box 90153, 5000 LE Tilburg The Netherlands;Department of Econometrics Erasmus University Rotterdam P.O. Box 1738, 3000 DR Rotterdam The Netherlands |
| |
| Abstract: | Polyhedral combinatorics is a subarea of combinatorial optimization of increasing practical importance. It deals with the application of the theory of linear systems and linear algebra to combinatorial problems. The paper is not intended as a survey on polyhedral combinatorics but it reviews some of the main concepts and proof techniques. |
| |
| Keywords: | cutting planes computational complexity facets integral polyhedra total unimodularity total dual integrality |
|
