Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
From MaRDI portal
Publication:1890949
DOI10.1016/0167-6377(94)90038-8zbMATH Open0826.90093OpenAlexW2111606357MaRDI QIDQ1890949FDOQ1890949
Authors: Pamela H. Vance, G. L. Nemhauser 
Publication date: 25 June 1995
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(94)90038-8
Recommendations
- A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- A polyhedral study on 0-1 knapsack problems with set packing constraints
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
facet-defining inequalities0-1 knapsack polytopegeneralized upper bound constraintslifting coefficients
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Boolean programming (90C09)
Cites Work
- Easily Computable Facets of the Knapsack Polytope
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- MINTO, a Mixed INTeger Optimizer
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- The complexity of lifted inequalities for the knapsack problem
Cited In (35)
- Lifting the knapsack cover inequalities for the knapsack polytope
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
- The complexity of lifted inequalities for the knapsack problem
- Zero-lifting for integer block structured problems
- Subset Algebra Lift Operators for 0-1 Integer Programming
- A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Knapsack polytopes: a survey
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
- 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
- \(O(n \log n)\) procedures for tightening cover inequalities
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On lifted cover inequalities: a new lifting procedure with unusual properties
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
- Lifting for mixed integer programs with variable upper bounds
- A branch-cut-and-price algorithm for the piecewise linear transportation problem
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- A polyhedral study on 0-1 knapsack problems with set packing constraints
- Cover and pack inequalities for (mixed) integer programming
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items
- Separation algorithms for 0-1 knapsack polytopes
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Facets of the Complementarity Knapsack Polytope
- A few strong knapsack facets
- Locating median cycles in networks
Uses Software
This page was built for publication: Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1890949)
