Vertex packings: Structural properties and algorithms
- 1 December 1975
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 8 (1) , 232-248
- https://doi.org/10.1007/bf01580444
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- Properties of vertex packing and independence system polyhedraMathematical Programming, 1974
- On the facial structure of set packing polyhedraMathematical Programming, 1973
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Anti-blocking polyhedraJournal of Combinatorial Theory, Series B, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Set Covering by Single-Branch Enumeration with Linear-Programming SubproblemsOperations Research, 1971
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- Covers and packings in a family of setsBulletin of the American Mathematical Society, 1962