Second-order cover inequalities
From MaRDI portal
Publication:927162
DOI10.1007/s10107-007-0098-4zbMath1145.90042OpenAlexW2168366735MaRDI QIDQ927162
Publication date: 4 June 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0098-4
Integer programmingFacets0-1 Pre-processingKnapsack cover inequalitiesNested cutsSurrogate constraints
Related Items
Knapsack polytopes: a survey, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Exploiting nested inequalities and surrogate constraints
- MINTO, a Mixed INTeger Optimizer
- Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
- Improved results on the 0--1 multidimensional knapsack problem
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Mixed logical-linear programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- An Improved Implicit Enumeration Approach for Integer Programming
- Flows in Arborescences
