Network Formulations of Mixed-Integer Programs

DOI10.1287/MOOR.1080.0354zbMath1218.90133DBLPjournals/mor/ConfortiSEW09OpenAlexW2126381243WikidataQ101129912 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 programmingcompact extended formulations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Related Items (13)

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

This page was built for publication: Network Formulations of Mixed-Integer Programs