Easily Computable Facets of the Knapsack Polytope
From MaRDI portal
Publication:3032082
Recommendations
- On the facets of the mixed-integer knapsack polyhedron
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- On facets of knapsack equality polytopes
- Facets of the Complementarity Knapsack Polytope
- Knapsack polytopes: a survey
- On the \(0/1\) knapsack polytope
- A note on the extension complexity of the knapsack polytope
- On the multiple integer knapsack polyhedra
- On the complexity of separation from the knapsack polytope
- scientific article; zbMATH DE number 1187156
Cited in
(47)- Two-set inequalities for the binary knapsack polyhedra
- A concise characterization of strong knapsack facets
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- Efficient reformulation for 0-1 programs -- methods and computational results
- Order selection on a single machine with high set-up costs
- A polyhedral study on 0-1 knapsack problems with set packing constraints
- Facets of the Complementarity Knapsack Polytope
- Polyhedral results for the precedence-constrained knapsack problem
- Cover and pack inequalities for (mixed) integer programming
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- On facets of knapsack equality polytopes
- On tightening cover induced inequalities
- A new sequential lifting of robust cover inequalities
- Lifting of probabilistic cover inequalities
- The Minkowski sum of simplices in 3-dimensional space. An analytical description
- Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
- Integrality gaps of linear and semi-definite programming relaxations for knapsack
- The aggregate capacity of virtual resources – linear models
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- \(O(n \log n)\) procedures for tightening cover inequalities
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
- A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints
- On lifted cover inequalities: a new lifting procedure with unusual properties
- Adjacency of the 0-1 knapsack problem
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- Separation algorithms for 0-1 knapsack polytopes
- Lifting the knapsack cover inequalities for the knapsack polytope
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- On the facets of the mixed-integer knapsack polyhedron
- A polyhedral study on chance constrained program with random right-hand side
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- Optimization algorithms for the disjunctively constrained knapsack problem
- Chance-Constrained Binary Packing Problems
- Technical Note—Some Very Easy Knapsack/Partition Problems
- The worst case analysis of strong knapsack facets
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- Lifting for the integer knapsack cover polyhedron
- Implicit cover inequalities
- The complexity of lifted inequalities for the knapsack problem
- 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
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- Knapsack polytopes: a survey
This page was built for publication: Easily Computable Facets of the Knapsack Polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3032082)
