On separating cover inequalities for the multidimensional knapsack problem
Authors:
- Tolga BektasTBTolga Bektas
- Osman OğuzOOOsman Oğuz
- 30 June 2007
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 34 (6) , 1771-1776
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Progress in Linear Programming-Based Algorithms for Integer Programming: An ExpositionINFORMS Journal on Computing, 2000
- Lifted Cover Inequalities for 0-1 Integer Programs: ComputationINFORMS Journal on Computing, 1998
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983