A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- 1 August 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 3 (3) , 411-430
- https://doi.org/10.1137/0403036
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming ProblemsOperations Research, 1990
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming ProblemsManagement Science, 1986
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1985
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- Facets of the Knapsack Polytope From Minimal CoversSIAM Journal on Applied Mathematics, 1978
- Improved Linear Integer Programming Formulations of Nonlinear Integer ProblemsManagement Science, 1975
- Facets of the knapsack polytopeMathematical Programming, 1975
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965