On separating cover inequalities for the multidimensional knapsack problem

DOI10.1016/J.COR.2005.05.032zbMATH Open1159.90460OpenAlexW2139189498MaRDI QIDQ858283FDOQ858283

Authors: Osman Oguz, Tolga Bektaş 

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

Recommendations

• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
• Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
• Multi-cover inequalities for totally-ordered multiple knapsack sets
• Lifting the knapsack cover inequalities for the knapsack polytope
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• On the complexity of sequentially lifting cover inequalities for the knapsack polytope
• Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
• Lifting cover inequalities for the precedence-constrained knapsack problem
• Simple lifted cover inequalities and hard knapsack problems

zbMATH Keywords

integer programmingcover inequalitiesseparation problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Solving Large-Scale Zero-One Linear Programming Problems
• Title not available (Why is that?)
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition

Cited In (14)

• Lifting the knapsack cover inequalities for the knapsack polytope
• Computational testing of a separation procedure for the knapsack set with a single continuous variable
• Knapsack Cover Subject to a Matroid Constraint
• On the exact separation of cover inequalities of maximum-depth
• Knapsack polytopes: a survey
• Simple lifted cover inequalities and hard knapsack problems
• On the complexity of sequentially lifting cover inequalities for the knapsack polytope
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• Separation algorithms for 0-1 knapsack polytopes
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Alternating control tree search for knapsack/covering problems
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems

This page was built for publication: On separating cover inequalities for the multidimensional knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858283)