Sequence independent lifting for mixed integer programs with variable upper bounds
From MaRDI portal
Publication:2583140
DOI10.1007/s10107-005-0664-6zbMath1085.90037OpenAlexW2107774361MaRDI QIDQ2583140
Publication date: 13 January 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0664-6
Related Items (6)
Lifting inequalities: a framework for generating strong cuts for nonlinear programs ⋮ Lifting for the integer knapsack cover polyhedron ⋮ A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting ⋮ Multi-commodity variable upper bound flow models ⋮ Sequence independent lifting for mixed integer programs with variable upper bounds ⋮ Lifting for mixed integer programs with variable upper bounds
Cites Work
- Unnamed Item
- Cutting planes in integer and mixed integer programming
- Valid inequalities for mixed 0-1 programs
- Capacitated facility location: Separation algorithms and computational experience
- The 0-1 knapsack problem with a single continuous variable
- On the polyhedral structure of a multi-item production planning model with setup times
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
- Sequence independent lifting in mixed integer programming
- Sequence independent lifting for mixed integer programs with variable upper bounds
- Valid Linear Inequalities for Fixed Charge Problems
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Capacitated Network Design—Polyhedral Structure and Computation
- A Polyhedral Study of Integer Variable Upper Bounds
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Valid inequalities for problems with additive variable upper bounds
This page was built for publication: Sequence independent lifting for mixed integer programs with variable upper bounds
