On separating cover inequalities for the multidimensional knapsack problem
From MaRDI portal
Publication:858283
DOI10.1016/j.cor.2005.05.032zbMath1159.90460MaRDI QIDQ858283
Publication date: 9 January 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/11441
Related Items
A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, Knapsack polytopes: a survey, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem, Separation algorithms for 0-1 knapsack polytopes
Cites Work