On the facial structure of set packing polyhedra
- 1 December 1973
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 5 (1), 199-215
- https://doi.org/10.1007/bf01580121
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the Set-Covering ProblemOperations Research, 1972
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- The Set-Partitioning Problem: Set Covering with Equality ConstraintsOperations Research, 1969
- Some polyhedra related to combinatorial problemsLinear Algebra and its Applications, 1969
- The Airline Crew Scheduling Problem: A SurveyTransportation Science, 1969
- Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming ProblemsManagement Science, 1968
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Covers and packings in a family of setsBulletin of the American Mathematical Society, 1962
- A Procedure for Clique Detection Using the Group MatrixSociometry, 1957