Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
From MaRDI portal
Publication:951101
DOI10.1016/J.DISOPT.2007.02.002zbMATH Open1151.90496OpenAlexW2127483759MaRDI QIDQ951101FDOQ951101
Authors: Hanif D. Sherali, Fred Glover 
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.02.002
Recommendations
- Second-order cover inequalities
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
- Multi-cover inequalities for totally-ordered multiple knapsack sets
- \(O(n \log n)\) procedures for tightening cover inequalities
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
Cites Work
- Network flows. Theory, algorithms, and applications.
- A generalization of antiwebs to independence systems and their canonical facets
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Sequence independent lifting in mixed integer programming
- Easily Computable Facets of the Knapsack Polytope
- 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
- Facets of the Knapsack Polytope From Minimal Covers
- Title not available (Why is that?)
- Nonlinear Programming
- On the 0,1 facets of the set covering polytope
- Improved results on the 0--1 multidimensional knapsack problem
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- An Improved Implicit Enumeration Approach for Integer Programming
- A note on the knapsack problem with special ordered sets
- Title not available (Why is that?)
- Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- MINTO, a Mixed INTeger Optimizer
- Title not available (Why is that?)
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Second-order cover inequalities
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Flows in Arborescences
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- Exploiting nested inequalities and surrogate constraints
- Rank inequalities and separation algorithms for packing designs and sparse triple systems.
Cited In (7)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
- Knapsack polytopes: a survey
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
- 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
- Second-order cover inequalities
- Multi-cover inequalities for totally-ordered multiple knapsack sets
Uses Software
This page was built for publication: Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951101)
