Recommendations
- Lifting the knapsack cover inequalities for the knapsack polytope
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
- scientific article; zbMATH DE number 2086920
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Description of 2-integer continuous knapsack polyhedra
- Flow pack facets of the single node fixed-charge flow polytope
- Hilbert Bases and the Facets of Special Knapsack Polytopes
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Lifted flow cover inequalities for mixed 0-1 integer programs
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- On capacitated network design cut-set polyhedra
- On the facets of the mixed-integer knapsack polyhedron
- On the multiple integer knapsack polyhedra
- Sequence Independent Lifting for Mixed-Integer Programming
- Sequence independent lifting in mixed integer programming
- Some polyhedra related to combinatorial problems
- The 0-1 knapsack problem with a single continuous variable
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
Cited in
(16)- Hybrid heuristics for a short sea inventory routing problem
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments
- Lifting for the integer knapsack cover polyhedron
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
- Simple lifted cover inequalities and hard knapsack problems
- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
- Mixing MIR inequalities with two divisible coefficients
- Theoretical challenges towards cutting-plane selection
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Description of 2-integer continuous knapsack polyhedra
- MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
- Two-set inequalities for the binary knapsack polyhedra
- Intersection cuts for single row corner relaxations
- Cascading knapsack inequalities: reformulation of a crude oil distribution problem
This page was built for publication: Lifting two-integer knapsack inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868448)
