Projecting an extended formulation for mixed-integer covers on bipartite graphs

Mathematics of Operations Research

Volumn 35, Issue 3, 2010, Pages 603-623

  Conforti, Michele ^a   Wolsey, Laurence A ^b   Zambelli, Giacomo ^a  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Extended formulations; Mixed integer programming; Mixing sets

Indexed keywords

BIPARTITE GRAPHS; CONTINUOUS MIXING; CONVEX HULL; DUAL MODEL; EXTENDED FORMULATIONS; MIXED-INTEGER; MIXED-INTEGER PROGRAMMING; MIXED-INTEGER SETS; MIXING SET; MIXING SETS; PRODUCTION PLANNING; VERTEX COVER;

DYNAMIC PROGRAMMING; GRAPH THEORY; MIXING; PRODUCTION CONTROL;

INTEGER PROGRAMMING;

EID: 77956629595     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1100.0454     Document Type: Article

References (12)

1. Christof, T., A. Loebel. 2009. PORTA-Polyhedron Representation Transformation Algorithm. http://www.zib.de/Optimization/Software/Porta/.
2. Conforti, M., B. Gerards, G. Zambelli. 2007. Mixed-integer vertex covers in bipartite graphs. Proc. 12th IPCO Conf., Lecture Notes in Computer Science, Vol.4513. Springer, Berlin, 324-336.
3. Conforti, M., M. Di Summa, L. A. Wolsey. 2007. The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows. Proc. 12th IPCO Conf., Lecture Notes in Computer Science, Vol.4513. Springer, Berlin, 352-366.
4. Conforti, M., M. Di Summa, F. Eisenbrand, L. A. Wolsey. 2009. Network formulations of mixed-integer programs. Math. Oper. Res. 34 194-209.
5. Günlük, O., Y. Pochet. 2001. Mixing mixed integer inequalities. Math. Programming 90 429-457.
6. Heller, I., C. B. Tompkins. 1956. An extension of a theorem of Dantzig's. H. W. Kuhn, A. W. Tucker, eds. Linear Inequalities and Related Systems. Princeton University Press, Princeton, NJ, 247-254.
7. Karp, R. 1978. A characterization of the minimum cycle mean in a digraph. Discrete Math. 23 309-311.
8. Miller, A., L. A. Wolsey. 2003. Tight formulations for some simple MIPs and convex objective IPs. Math. Programming Ser. B 98 73-88.
9. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley Interscience, New York.
10. Pochet, Y., L. A. Wolsey. 1994. Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Programming 67 297-324.
11. Pochet, Y., L. A. Wolsey. 2006. Production Planning by Mixed Integer Programming. Springer Series in Operations Research and Financial Engineering, New York.
12. Van Vyve, M. 2005. The continuous mixing polyhedron. Math. Oper. Res. 30 441-452.