Extended Formulations in Combinatorial Optimization
暂无分享,去创建一个
[1] Alfred Bochert. Ueber die Zahl der verschiedenen Werthe, die eine Function gegebener Buchstaben durch Vertauschung derselben erlangen kann , 1897 .
[2] H. Weyl. Elementare Theorie der konvexen Polyeder , 1934 .
[3] John von Neumann,et al. 1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem , 1953 .
[4] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[5] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[6] Egon Balas,et al. The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.
[7] János Komlós,et al. Sorting in c log n parallel sets , 1983, Comb..
[8] E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .
[9] Ronald L. Rardin,et al. Polyhedral Characterization of Discrete Dynamic Programming , 1990, Oper. Res..
[10] J. Humphreys. Reflection groups and coxeter groups , 1990 .
[11] R. Carter. REFLECTION GROUPS AND COXETER GROUPS (Cambridge Studies in Advanced Mathematics 29) , 1991 .
[12] Wojciech Szatzschneider,et al. An Inequality , 1991, SIAM Rev..
[13] M. Yannakakis. Expressing combinatorial optimization problems by linear programs , 1991, Symposium on the Theory of Computing.
[14] R. Kipp Martin,et al. Using separation algorithms to generate mixed integer model reformulations , 1991, Oper. Res. Lett..
[15] F. B. Shepherd,et al. Formulations for the stable set polytope , 1992 .
[16] Francisco Barahona,et al. On cuts and matchings in planar graphs , 1993, Math. Program..
[17] Joel E. Cohen,et al. Nonnegative ranks, decompositions, and factorizations of nonnegative matrices , 1993 .
[18] E. Kushilevitz,et al. Communication Complexity: Basics , 1996 .
[19] Arkadi Nemirovski,et al. On Polyhedral Approximations of the Second-Order Cone , 2001, Math. Oper. Res..
[20] Igor Rivin. Combinatorial optimization in geometry , 2003, Adv. Appl. Math..
[21] Volker Kaibel,et al. Extended Formulations for Packing and Partitioning Orbitopes , 2008, Math. Oper. Res..
[22] Laurence A. Wolsey,et al. Network Formulations of Mixed-Integer Programs , 2006, Math. Oper. Res..
[23] Viet Hung Nguyen,et al. On the Convex Hull of Huffman Trees , 2010, Electron. Notes Discret. Math..
[24] G. Oriolo,et al. The hidden-matching structure of the composition of strips : a polyhedral perspective , 2010 .
[25] Laurence A. Wolsey,et al. Reformulation and Decomposition of Integer Programs , 2009, 50 Years of Integer Programming.
[26] Gérard Cornuéjols,et al. Extended formulations in combinatorial optimization , 2010, 4OR.
[27] Dirk Oliver Theis,et al. Symmetry Matters for the Sizes of Extended Formulations , 2010, IPCO.
[28] Volker Kaibel,et al. Branched Polyhedral Systems , 2010, IPCO.
[29] Volker Kaibel,et al. Constructing Extended Formulations from Reflection Relations , 2010, IPCO.
[30] Samuel Fiorini,et al. Combinatorial bounds on nonnegative rank and extended formulations , 2011, Discret. Math..