Polyhedral results for the precedence-constrained knapsack problem
- 9 February 1993
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 41 (3) , 185-201
- https://doi.org/10.1016/0166-218x(90)90053-f
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Valid inequalities and facets of the capacitated plant location problemMathematical Programming, 1989
- Polyhedral Results for AntimatroidsaAnnals of the New York Academy of Sciences, 1989
- The simple plant location problem: Survey and synthesisEuropean Journal of Operational Research, 1983
- Some facets of the simple plant location polytopeMathematical Programming, 1982
- Facets of the Knapsack Polytope From Minimal CoversSIAM Journal on Applied Mathematics, 1978
- Facet of regular 0–1 polytopesMathematical Programming, 1975
- Faces for a linear inequality in 0–1 variablesMathematical Programming, 1975
- Facets of the knapsack polytopeMathematical Programming, 1975
- Properties of vertex packing and independence system polyhedraMathematical Programming, 1974
- On the facial structure of set packing polyhedraMathematical Programming, 1973