Integral Polyhedra Related to Even Cycle and Even Cut Matroids
暂无分享,去创建一个
[1] Alfred Lehman,et al. A Solution of the Shannon Switching Game , 1964 .
[2] Bertrand Guenin. A Characterization of Weakly Bipartite Graphs , 1998, IPCO.
[3] Gérard Cornuéjols,et al. The packing property , 2000, Math. Program..
[4] Michel X. Goemans,et al. Minimizing submodular functions over families of sets , 1995, Comb..
[5] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[6] Paul D. Seymour,et al. The matroids with the max-flow min-cut property , 1977, J. Comb. Theory B.
[7] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[8] Paul D. Seymour,et al. Matroids and Multicommodity Flows , 1981, Eur. J. Comb..
[9] T. C. Hu. Multi-Commodity Network Flows , 1963 .
[10] B. Rothschild,et al. MULTICOMMODITY NETWORK FLOWS. , 1969 .
[11] Gérard Cornuéjols,et al. Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour , 2002, SIAM J. Discret. Math..
[12] W. T. Tutte. A homotopy theorem for matroids. II , 1958 .
[13] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..
[14] H. Ryser,et al. COMBINATORIAL DESIGNS AND RELATED SYSTEMS , 1969 .
[15] Alfred Lehman,et al. On the width-length inequality , 1979, Math. Program..