Premium
Polyhedral Combinatorics in Combinatorial Optimization
Author(s) -
Gerards A.M.H.,
Kolen A.W.J.
Publication year - 1987
Publication title -
statistica neerlandica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.52
H-Index - 39
eISSN - 1467-9574
pISSN - 0039-0402
DOI - 10.1111/j.1467-9574.1987.tb01168.x
Subject(s) - combinatorial principles , enumerative combinatorics , mathematics , combinatorial optimization , combinatorics , combinatorial proof , linear algebra , combinatorial algorithms , combinatorial method , extremal combinatorics , combinatorial analysis , combinatorial design , algebra over a field , combinatorial explosion , pure mathematics , algorithm , geometry
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.