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

References

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