Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
From MaRDI portal
(Redirected from Publication:1890949)
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
Cites work
- Easily Computable Facets of the Knapsack Polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Facets of the knapsack polytope
- MINTO, a Mixed INTeger Optimizer
- The complexity of lifted inequalities for the knapsack problem
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
Cited in
(35)- Lifting the knapsack cover inequalities for the knapsack polytope
- The complexity of lifted inequalities for the knapsack problem
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
- Zero-lifting for integer block structured problems
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- Subset Algebra Lift Operators for 0-1 Integer Programming
- A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints
- Knapsack polytopes: a survey
- scientific article; zbMATH DE number 3874956 (Why is no real title available?)
- scientific article; zbMATH DE number 2086929 (Why is no real title available?)
- 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
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
- \(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
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- 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
- Locating median cycles in networks
- A few strong knapsack facets
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)
