On separating cover inequalities for the multidimensional knapsack problem
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Solving Large-Scale Zero-One Linear Programming Problems
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
- Alternating control tree search for knapsack/covering problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack 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)
