Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs

DOI10.1287/MOOR.1100.0454zbMath1218.90134OpenAlexW2162131491MaRDI QIDQ3169109

Laurence A. Wolsey, Michele Conforti, Giacomo Zambelli

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.1100.0454

zbMATH Keywords

mixed-integer programmingextended formulationsmixing sets

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (5)

On a class of mixed-integer sets with a single integer variable ⋮ Fixed-charge transportation on a path: optimization, LP formulations and separation ⋮ Fixed-Charge Transportation on a Path: Linear Programming Formulations ⋮ Extended formulations in combinatorial optimization ⋮ Extended formulations in combinatorial optimization

Uses Software

• PORTA

This page was built for publication: Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs