On the mixing set with a knapsack constraint
- 28 January 2016
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 157 (1) , 191-217
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Natural Sciences and Engineering Research Council of Canada (RGPIN-05623)
This publication has 16 references indexed in Scilit:
- Approximate formulations for 0-1 knapsack setsOperations Research Letters, 2008
- Sequential pairing of mixed integer inequalitiesDiscrete Optimization, 2007
- A branch and bound method for stochastic integer problems under probabilistic constraintsOptimization Methods and Software, 2002
- Mixing mixed-integer inequalitiesMathematical Programming, 2001
- The mixed vertex packing problemMathematical Programming, 2000
- On the dimension of projected polyhedraDiscrete Applied Mathematics, 1998
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1985
- Facets of the Knapsack Polytope From Minimal CoversSIAM Journal on Applied Mathematics, 1978
- Facet of regular 0–1 polytopesMathematical Programming, 1975
- Facets of the knapsack polytopeMathematical Programming, 1975