The cut cone, L1 embeddability, complexity, and multicommodity flows
暂无分享,去创建一个
David Avis | Michel Deza | D. Avis | M. Deza
[1] T. C. Hu. Multi-Commodity Network Flows , 1963 .
[2] Michel Deza,et al. The classification of finite connected hypermetric spaces , 1987, Graphs Comb..
[3] B. Rothschild,et al. MULTICOMMODITY NETWORK FLOWS. , 1969 .
[4] Viatcheslav P. Grishukhin. All Facets of the Cut Cone Cn for n = 7 are Known , 1990, Eur. J. Comb..
[5] Caterina De Simone,et al. The cut polytope and the Boolean quadric polytope , 1990, Discret. Math..
[6] David Avis. Extremal Metrics Induced by Graphs , 1980 .
[7] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[8] Martin Grötschel,et al. Clique-Web Facets for Multicut Polytopes , 1992, Math. Oper. Res..
[9] J. Williamson,et al. Determinants whose Elements are 0 and 1 , 1946 .
[10] Michel Deza,et al. Rigid pentagons in hypercubes , 1988, Graphs Comb..
[11] David Avis,et al. All the Facets of the Six-point Hamming Cone , 1989, Eur. J. Comb..
[12] D. Djoković. Distance-preserving subgraphs of hypercubes , 1973 .
[13] H. Maehara,et al. Metric transforms and Euclidean embeddings , 1990 .
[14] Michel Deza,et al. New Results on Facets of the Cut Cone , 1990, Conference on Integer Programming and Combinatorial Optimization.
[15] David Avis,et al. Hypermetric Spaces and the Hamming Cone , 1981, Canadian Journal of Mathematics.
[16] Antonio Sassano,et al. The equipartition polytope. I: Formulations, dimension and basic facets , 1990, Math. Program..
[17] B. Rothschild,et al. On Two Commodity Network Flows , 1966, Oper. Res..
[18] Martin Grötschel,et al. An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..
[19] Ian Holyer,et al. The NP-Completeness of Some Edge-Partition Problems , 1981, SIAM J. Comput..
[20] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[21] Keith Ball. Isometric Embedding in lp-spaces , 1990, Eur. J. Comb..
[22] Paul D. Seymour,et al. Four-terminus flows , 1980, Networks.
[23] David Avis. On the Complexity of Isometric Embedding in the Hypercube , 1990, SIGAL International Symposium on Algorithms.
[24] K. Onaga,et al. On feasibility conditions of multicommodity flows in networks , 1971 .
[25] Patrice Assouad. Sur les Inégalités Valides dans L1 , 1984, Eur. J. Comb..
[26] V. Chvétal. Recognizing Intersection Patterns , 1980 .
[27] F. Barahona. The max-cut problem on graphs not contractible to K5 , 1983 .
[28] Michel Deza,et al. The inequicut cone , 1993, Discret. Math..
[29] Alexander V. Karzanov. Half-integral five-terminus flows , 1987, Discret. Appl. Math..
[30] Ali Ridha Mahjoub,et al. On the cut polytope , 1986, Math. Program..
[31] Alexander V. Karzanov,et al. Metrics and undirected cuts , 1985, Math. Program..
[32] Michel Deza,et al. The cut cone III: On the role of triangle facets , 1992, Graphs Comb..
[33] Michel Deza,et al. Positive independence and enumeration of codes with a given distance pattern , 1990 .
[34] D. Avis. On the Extreme Rays of the Metric Cone , 1980, Canadian Journal of Mathematics.
[35] Michel Deza,et al. The even and odd cut polytopes , 1993, Discret. Math..