暂无分享,去创建一个
[1] Thomas Rothvoß,et al. The matching polytope has exponential extension complexity , 2013, STOC.
[2] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[3] W. M. B. Dukes. Bounds on the number of generalized partitions and some applications , 2003, Australas. J Comb..
[4] H. P. Williams,et al. A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem , 2007 .
[5] Benny Sudakov,et al. Submodular Minimization Under Congruency Constraints , 2019, Comb..
[6] Volker Kaibel,et al. A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially , 2013, Discret. Comput. Geom..
[7] Temel Öncan,et al. A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..
[8] Volker Kaibel,et al. Maximum semidefinite and linear extension complexity of families of polytopes , 2018, Math. Program..
[9] Egon Balas. Disjunctive Programming , 2010, 50 Years of Integer Programming.
[10] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[11] Thomas Rothvoß,et al. Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..
[12] Alexander Barvinok,et al. A course in convexity , 2002, Graduate studies in mathematics.
[13] Ting-Yi Sung,et al. An analytical comparison of different formulations of the travelling salesman problem , 1991, Math. Program..
[14] M. Yannakakis. Expressing combinatorial optimization problems by linear programs , 1991, Symposium on the Theory of Computing.
[15] Rahul Jain,et al. Extension Complexity of Independent Set Polytopes , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[16] Sebastian Pokutta,et al. The matching polytope does not admit fully-polynomial size relaxation schemes , 2015, SODA.
[17] G. C. Shephard. Inequalities between mixed volumes of convex sets , 1960 .
[18] Sergey I. Veselov,et al. Integer program with bimodular matrix , 2008, Discret. Optim..
[19] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[20] Samuel Fiorini,et al. Approximation Limits of Linear Programs (Beyond Hierarchies) , 2015, Math. Oper. Res..
[21] Sebastian Pokutta,et al. A note on the extension complexity of the knapsack polytope , 2013, Oper. Res. Lett..
[22] S. Voß,et al. A classification of formulations for the (time-dependent) traveling salesman problem , 1995 .
[23] Michele Conforti,et al. Subgraph polytopes and independence polytopes of count matroids , 2015, Oper. Res. Lett..
[24] Rico Zenklusen,et al. Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations , 2017, SODA.
[25] Hans Raj Tiwary,et al. On the extension complexity of combinatorial polytopes , 2013, Math. Program..
[26] Rico Zenklusen,et al. A strongly polynomial algorithm for bimodular integer linear programming , 2017, STOC.
[27] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[28] Volker Kaibel,et al. Lower bounds on the sizes of integer programs without additional variables , 2013, Math. Program..
[29] Caterina De Simone,et al. The cut polytope and the Boolean quadric polytope , 1990, Discret. Math..
[30] Gérard Cornuéjols,et al. Extended formulations in combinatorial optimization , 2013, Ann. Oper. Res..