暂无分享,去创建一个
Michele Conforti | Volker Kaibel | Matthias Walter | Stefan Weltge | V. Kaibel | M. Conforti | Matthias Walter | Stefan Weltge
[1] Thomas Rothvoß,et al. Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..
[2] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .
[3] Hans Raj Tiwary,et al. Extended formulations, nonnegative factorizations, and randomized communication protocols , 2011, Mathematical Programming.
[4] Egon Balas. Disjunctive Programming , 2010, 50 Years of Integer Programming.
[5] R. Kipp Martin,et al. Using separation algorithms to generate mixed integer model reformulations , 1991, Oper. Res. Lett..
[6] Justin C. Williams,et al. A linear‐size zero—one programming model for the minimum spanning tree problem in planar graphs , 2002, Networks.
[7] A. Frank. Connections in Combinatorial Optimization , 2011 .
[8] Yoshio Okamoto,et al. Extended formulations for sparsity matroids , 2014, Math. Program..
[9] Volker Kaibel,et al. Forbidden Vertices , 2013, Math. Oper. Res..
[10] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..