Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations
暂无分享,去创建一个
[1] S. Voß,et al. A classification of formulations for the (time-dependent) traveling salesman problem , 1995 .
[2] Ting-Yi Sung,et al. An analytical comparison of different formulations of the travelling salesman problem , 1991, Math. Program..
[3] Shirley Dex,et al. JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .
[4] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[5] Thomas Rothvoß,et al. The matching polytope has exponential extension complexity , 2013, STOC.
[6] Volker Kaibel,et al. Lower bounds on the sizes of integer programs without additional variables , 2015, Math. Program..
[7] Volker Kaibel,et al. Lower bounds on the sizes of integer programs without additional variables , 2013, Math. Program..
[8] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.
[9] Hans Raj Tiwary,et al. Extended Formulations for Polygons , 2011, Discret. Comput. Geom..
[10] Thomas Rothvoß,et al. Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..
[11] Mark Braverman,et al. An information complexity approach to extended formulations , 2013, STOC '13.
[12] Guus Regts,et al. Polyhedra with the Integer Carathéodory Property , 2010, J. Comb. Theory, Ser. B.
[13] Rico Zenklusen,et al. Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix , 2015, Math. Program..
[14] Egon Balas,et al. Disjunctive Programming: Properties of the Convex Hull of Feasible Points , 1998, Discret. Appl. Math..
[15] Temel Öncan,et al. A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..
[16] Alexander E. Litvak,et al. The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces , 1999, Math. Oper. Res..
[17] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[18] Matthias Köppe,et al. A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn) , 2010, Discret. Optim..
[19] Hans Raj Tiwary,et al. Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.
[20] Sebastian Pokutta,et al. Common Information and Unique Disjointness , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[21] Samuel Fiorini,et al. Approximation Limits of Linear Programs (Beyond Hierarchies) , 2015, Math. Oper. Res..
[22] M. Yannakakis. Expressing combinatorial optimization problems by linear programs , 1991, Symposium on the Theory of Computing.
[23] Dirk Oliver Theis,et al. Symmetry Matters for the Sizes of Extended Formulations , 2010, IPCO.
[24] H. P. Williams,et al. A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem , 2007 .