A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
Authors:
- 31 August 2002
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 30 (4) , 252-264
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A Genetic Algorithm for the Multidimensional Knapsack ProblemJournal of Heuristics, 1998
- On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problemsAnnals of Operations Research, 1998
- An efficient preprocessing procedure for the multidimensional 0–1 knapsack problemDiscrete Applied Mathematics, 1994
- Efficient reformulation for 0–1 programs — methods and computational resultsDiscrete Applied Mathematics, 1993
- On tightening cover induced inequalitiesEuropean Journal of Operational Research, 1992
- Heuristics and reduction methods for multiple constraints 0–1 linear programming problemsEuropean Journal of Operational Research, 1986
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Facets of the Knapsack Polytope From Minimal CoversSIAM Journal on Applied Mathematics, 1978
- Facets of the knapsack polytopeMathematical Programming, 1975
- Canonical Cuts on the Unit HypercubeSIAM Journal on Applied Mathematics, 1972