A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
From MaRDI portal
Publication:1866008
DOI10.1016/S0167-6377(02)00124-4zbMath1049.90074OpenAlexW2000043213MaRDI QIDQ1866008
Michel Minoux, Virginie Gabrel
Publication date: 3 April 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00124-4
Related Items
Knapsack polytopes: a survey, Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem, Separation algorithms for 0-1 knapsack polytopes, Bin packing and cutting stock problems: mathematical models and exact algorithms, On the complexity of separation from the knapsack polytope, Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem, Rerouting tunnels for MPLS network resource optimization, Recoverable robust knapsacks: the discrete scenario case, An efficient algorithm for the collapsing knapsack problem, Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem, Optimization algorithms for the disjunctively constrained knapsack problem, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- On tightening cover induced inequalities
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
- A genetic algorithm for the multidimensional knapsack problem
- Exact solution of multicommodity network optimization problems with general step cost functions
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- MINTO, a Mixed INTeger Optimizer
- Efficient reformulation for 0-1 programs -- methods and computational results
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Dioïds and semirings: Links to fuzzy sets and other applications
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Solving Large-Scale Zero-One Linear Programming Problems
- Combinatorial Optimization with Rational Objective Functions
- (1,k)-configurations and facets for packing problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Surrogate Constraints in Integer Programming
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- On The Strength Of Relaxations Of Multidimensional Knapsack Problems
- Solving Multiple Knapsack Problems by Cutting Planes
- Canonical Cuts on the Unit Hypercube
