Strong formulations for mixed integer programs: valid inequalities and extended formulations
From MaRDI portal
Publication:1403296
DOI10.1007/s10107-003-0450-2zbMath1035.90052OpenAlexW1548640495MaRDI QIDQ1403296
Publication date: 1 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0450-2
Mixed integer programming (90C11) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (9)
Efficient reformulations for dynamic lot-sizing problems with product substitution ⋮ On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets ⋮ The mixing-MIR set with divisible capacities ⋮ Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints ⋮ Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity ⋮ Mixing polyhedra with two non divisible coefficients ⋮ A note on the continuous mixing set ⋮ Challenges in Enterprise Wide Optimization for the Process Industries ⋮ Approximate extended formulations
This page was built for publication: Strong formulations for mixed integer programs: valid inequalities and extended formulations
