暂无分享,去创建一个
[1] A. Ruszczynski,et al. Nonlinear Optimization , 2006 .
[2] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[3] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[4] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[5] Ying Xiong. Nonlinear Optimization , 2014 .
[6] M. R. Rao,et al. Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..
[7] Thomas Rothvoß,et al. The matching polytope has exponential extension complexity , 2013, STOC.
[8] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..
[9] R. Kipp Martin,et al. Using separation algorithms to generate mixed integer model reformulations , 1991, Oper. Res. Lett..
[10] Gérard Cornuéjols,et al. Extended formulations in combinatorial optimization , 2010, 4OR.
[11] Andreas S. Schulz,et al. 0/1-Integer Programming: Optimization and Augmentation are Equivalent , 1995, ESA.
[12] Hans Raj Tiwary,et al. On the extension complexity of combinatorial polytopes , 2015, Math. Program..
[13] Michele Conforti,et al. Subgraph polytopes and independence polytopes of count matroids , 2015, Oper. Res. Lett..
[14] Friedrich Eisenbrand,et al. A compact linear program for testing optimality of perfect matchings , 2003, Oper. Res. Lett..
[15] Hans Raj Tiwary,et al. Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.
[16] Egon Balas,et al. programming: Properties of the convex hull of feasible points * , 1998 .
[17] Andreas S. Schulz. On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming , 2008, Bonn Workshop of Combinatorial Optimization.
[18] Samuel Fiorini,et al. Approximation Limits of Linear Programs (Beyond Hierarchies) , 2015, Math. Oper. Res..
[19] Sebastian Pokutta,et al. A note on the extension complexity of the knapsack polytope , 2013, Oper. Res. Lett..