Separation algorithms for 0-1 knapsack polytopes
- 8 May 2010
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 124 (1-2) , 69-91
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Local and global lifted cover inequalities for the 0–1 multidimensional knapsack problemEuropean Journal of Operational Research, 2008
- On separating cover inequalities for the multidimensional knapsack problemComputers & Operations Research, 2007
- MIPLIB 2003Operations Research Letters, 2006
- Cover and Pack Inequalities for (Mixed) Integer ProgrammingAnnals of Operations Research, 2005
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problemsOperations Research Letters, 2002
- The complexity of cover inequality separationOperations Research Letters, 1998
- Generating Fenchel Cutting Planes for Knapsack PolyhedraSIAM Journal on Optimization, 1993
- A pseudopolynomial network flow formulation for exact knapsack separationNetworks, 1992
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Algorithm 230: Matrix PermutationCommunications of the ACM, 1964