Separation algorithms for 0-1 knapsack polytopes
From MaRDI portal
Recommendations
- On the complexity of separation from the knapsack polytope
- On the \(0/1\) knapsack polytope
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
- The 0-1 knapsack problem with a single continuous variable
Cites work
- (1,k)-configurations and facets for packing problems
- A genetic algorithm for the multidimensional knapsack problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A pseudopolynomial network flow formulation for exact knapsack separation
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- Cover and pack inequalities for (mixed) integer programming
- Easily Computable Facets of the Knapsack Polytope
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Fenchel Cutting Planes for Integer Programs
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1182577 (Why is no real title available?)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Introduction to algorithms
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- MIPLIB 2003
- On separating cover inequalities for the multidimensional knapsack problem
- On the \(0/1\) knapsack polytope
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Sequence independent lifting in mixed integer programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Solving Multiple Knapsack Problems by Cutting Planes
- The complexity of cover inequality separation
Cited in
(59)- The 0-1 knapsack problem with a single continuous variable
- On the \(0/1\) knapsack polytope
- Primal separation algorithms
- The min-up/min-down unit commitment polytope
- An effective hybrid approach to the two-stage capacitated facility location problem
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
- Optimization algorithms for the disjunctively constrained knapsack problem
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- The generalized reserve set covering problem with connectivity and buffer requirements
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- On the exact separation of cover inequalities of maximum-depth
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- On the complexity of separation from the knapsack polytope
- A MIP-based approach to solve the prize-collecting local access network design problem
- On lifted cover inequalities: a new lifting procedure with unusual properties
- New valid inequalities for the fixed-charge and single-node flow polytopes
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- The incremental connected facility location problem
- A cutting plane method for knapsack polytope
- A cutting plane algorithm for the capacitated connected facility location problem
- Fast separation for the three-index assignment problem
- A comparison of integer programming models for the partial directed weighted improper coloring problem
- A branch-and-price-and-cut approach for sustainable crop rotation planning
- Implicit cover inequalities
- Lifting the knapsack cover inequalities for the knapsack polytope
- On inequalities with bounded coefficients and pitch for the min knapsack polytope
- A cut-and-branch algorithm for the quadratic knapsack problem
- Computational testing of a separation procedure for the knapsack set with a single continuous variable
- On the knapsack closure of 0-1 integer linear programs
- Chance-Constrained Binary Packing Problems
- A comparison of some valid inequality generation methods for general 0-1 problems
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- An implementation of exact knapsack separation
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- A pseudopolynomial network flow formulation for exact knapsack separation
- Lifting and separation of robust cover inequalities
- On the transportation problem with market choice
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- On the exact separation of mixed integer knapsack cuts
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
- Lifting for the integer knapsack cover polyhedron
- On the complexity of separating cutting planes for the knapsack polytope
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- Two-set inequalities for the binary knapsack polyhedra
- On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations
- Recoverable robust knapsacks: the discrete scenario case
- Cover-based inequalities for the single-source capacitated facility location problem with customer preferences
- Last fifty years of integer linear programming: a focus on recent practical advances
- An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
- Enhancing the separation of rank-1 Chvátal-Gomory cuts from knapsack sets
- Computational aspects of lifted cover inequalities for knapsacks with few different weights
- Knapsack polytopes: a survey
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope
- Approximating polyhedra with sparse inequalities
This page was built for publication: Separation algorithms for 0-1 knapsack polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638369)
