Finite checkability for integer rounding properties in combinatorial programming problems
- 1 December 1982
- journal article
- research article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 22 (1), 141-147
- https://doi.org/10.1007/bf01581034
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier BV ,1977
- On the Perfect Graph TheoremPublished by Elsevier BV ,1973
- A characterization of perfect graphsJournal of Combinatorial Theory, Series B, 1972
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- Anti-blocking polyhedraJournal of Combinatorial Theory, Series B, 1972
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971