Polyhedral Combinatorics in Combinatorial Optimization

A.M.H. Gerards and A.W.J. Kolen

Statistica Neerlandica, 1987, vol. 41, issue 1, 1-25

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.

Date: 1987
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.1987.tb01168.x

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:bla:stanee:v:41:y:1987:i:1:p:1-25

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().