Faces for a linear inequality in 0–1 variables
- 1 December 1975
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 8 (1), 165-178
- https://doi.org/10.1007/bf01580441
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Facet of regular 0–1 polytopesMathematical Programming, 1975
- Facets of the knapsack polytopeMathematical Programming, 1975
- Properties of vertex packing and independence system polyhedraMathematical Programming, 1974
- Coefficient reduction for inequalities in 0–1 variablesMathematical Programming, 1974
- Canonical Cuts on the Unit HypercubeSIAM Journal on Applied Mathematics, 1972
- Matroids and the greedy algorithmMathematical Programming, 1971
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965