Network Formulations of Mixed-Integer Programs

DOI10.1287/moor.1080.0354zbMath1218.90133WikidataQ101129912 ScholiaQ101129912MaRDI QIDQ3169026

Friedrich Eisenbrand, Michele Conforti, Marco Di Summa, Laurence A. Wolsey

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1080.0354

zbMATH Keywords

mixed-integer programming; compact extended formulations

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C11: Mixed integer programming

Related Items

Unnamed Item, Extended formulations in combinatorial optimization, Extended formulations in combinatorial optimization, Relaxations for two-level multi-item lot-sizing problems, On a class of mixed-integer sets with a single integer variable, Mixing polyhedra with two non divisible coefficients, Finding a bounded mixed-integer solution to a system of dual network inequalities, On matrices with the Edmonds-Johnson property, On matrices with the Edmonds-Johnson property arising from bidirected graphs, Convex hull results for generalizations of the constant capacity single node flow set, Fixed-charge transportation on a path: optimization, LP formulations and separation, Fixed-Charge Transportation on a Path: Linear Programming Formulations, The Mixing Set with Divisible Capacities