Lifting for mixed integer programs with variable upper bounds
From MaRDI portal
Publication:2345614
DOI10.1016/j.dam.2015.01.002zbMath1323.90043OpenAlexW2118330648MaRDI QIDQ2345614
Publication date: 22 May 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.002
Related Items (2)
Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ Unnamed Item
Cites Work
- Unnamed Item
- The convex hull of two core capacitated network design problems
- Cover and pack inequalities for (mixed) integer programming
- Valid inequalities for mixed 0-1 programs
- Deterministic lotsizing models for production planning
- 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: Basic theory and algorithms
- 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
- Polyhedral description of the integer single node flow set with constant bounds
- Sequence independent lifting for mixed integer programs with variable upper bounds
- Network design arc set with variable upper bounds
- Sequence Independent Lifting for Mixed-Integer Programming
- Valid Linear Inequalities for Fixed Charge Problems
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Graph Theory and Integer Programming
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Capacitated Network Design—Polyhedral Structure and Computation
- Valid inequalities for problems with additive variable upper bounds
This page was built for publication: Lifting for mixed integer programs with variable upper bounds
