On the cut polyhedron-Reference-Cited by-同舟云学术

On the cut polyhedron

Published:2004-02 Issue:1-3 Volume:277 Page:279-285
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Conforti Michele,Rinaldi Giovanni,Wolsey Laurence

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference12 articles.

1. Small min-cut polyhedra;Alevras;Math. Oper. Res.,1999

2. The minimum number of edges and vertices in a graph with edge connectivity n and m n-bonds;Bixby;Networks,1975

3. The traveling salesman problem on a graph and some related integer polyhedra;Cornuéjols;Math. Programming,1985

4. On cycle cones and polyhedra;Coullard;Linear Algebra Appl.,1989

5. E.A. Dinič, A.V. Karzanov, M.V. Lomonosov, A structure of the system of all minimal cuts of a graph, in: A.A. Fridman (Ed.), Studies in Discrete Optimization, Nauka, Moscow, 1976, pp. 290–306 (in Russian).

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Cone Partitions for the Min-Cut and Max-Cut Problems with Non-negative Edges;Communications in Computer and Information Science;2023

2. Regular Matroids Have Polynomial Extension Complexity;Mathematics of Operations Research;2021-07-23

3. Cut Dominants and Forbidden Minors;SIAM Journal on Discrete Mathematics;2016-01

4. On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems;International Journal of Mathematics and Mathematical Sciences;2016

5. On the polyhedral structure of uniform cut polytopes;Discrete Applied Mathematics;2014-10