×

Further facet generating procedures for vertex packing polytopes. (English) Zbl 0348.90148


MSC:

90C10 Integer programming
90C35 Programming involving graphs or networks
52Bxx Polytopes and polyhedra
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] E. Balas and M.W. Padberg, ”Set partitioning”, Lecture Notes for the Nato Advanced Study Institute on Combinatorial Programming, Versailles (September 1973). · Zbl 0309.90061
[2] V. Chvatal, ”On certain polytopes associated with graphs”,Journal of Combinatorial Theory B, 18 (1975) 138–154. · Zbl 0277.05139 · doi:10.1016/0095-8956(75)90041-6
[3] G.L. Nemhauser and L.E. Trotter, ”Properties of vertex packing and independence system polyhedra”,Mathematical Programming 6 (1974) 48–61. · Zbl 0281.90072 · doi:10.1007/BF01580222
[4] M.W. Padberg, ”On the facial structure of set packing polyhedra”,Mathematical Programming 5 (1973) 199–215. · Zbl 0272.90041 · doi:10.1007/BF01580121
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.