Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
From MaRDI portal
Publication:951099
DOI10.1016/J.DISOPT.2007.05.003zbMATH Open1151.90026OpenAlexW2036861438MaRDI QIDQ951099FDOQ951099
Authors: T. Easton, Kevin Hooker 
Publication date: 29 October 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2007.05.003
Recommendations
- Lifting the knapsack cover inequalities for the knapsack polytope
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- The complexity of lifted inequalities for the knapsack problem
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of cover inequality separation
- Corner polyhedra and their connection with cutting planes
- Sequence independent lifting in mixed integer programming
- Some polyhedra related to combinatorial problems
- Easily Computable Facets of the Knapsack Polytope
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- On the facial structure of set packing polyhedra
- An Algorithm for Large Zero-One Knapsack Problems
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Discrete-variable extremum problems
- A New Algorithm for the 0-1 Knapsack Problem
- On the \(0/1\) knapsack polytope
- Title not available (Why is that?)
- Lifting the facets of zero–one polytopes
- Hard Knapsack Problems
- An algorithm for the solution of the 0-1 knapsack problem
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Title not available (Why is that?)
- Simple lifted cover inequalities and hard knapsack problems
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations
- Title not available (Why is that?)
Cited In (19)
- Lifting of probabilistic cover inequalities
- Lifting the knapsack cover inequalities for the knapsack polytope
- Implicit cover inequalities
- Lifting for the integer knapsack cover polyhedron
- Knapsack polytopes: a survey
- On tightening cover induced inequalities
- Simple lifted cover inequalities and hard knapsack problems
- Lifting and separation of robust cover inequalities
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
- Approximate and exact merging of knapsack constraints with cover inequalities
- Sequence independent, simultaneous and multidimensional lifting of generalized flow covers for the semi-continuous knapsack problem with generalized upper bounds constraints
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- On separating cover inequalities for the multidimensional knapsack problem
- Separation algorithms for 0-1 knapsack polytopes
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
- Lift-and-project methods for set cover and knapsack
- A new sequential lifting of robust cover inequalities
- Two-set inequalities for the binary knapsack polyhedra
Uses Software
This page was built for publication: Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951099)
