首页   按字顺浏览 期刊浏览 卷期浏览 On the multiway cut polyhedron
On the multiway cut polyhedron

 

作者: Sunil Chopra,   M. R. Rao,  

 

期刊: Networks  （WILEY Available online 1991）
卷期: Volume 21, issue 1  

页码: 51-89

 

ISSN:0028-3045

 

年代: 1991

 

DOI:10.1002/net.3230210106

 

出版商: Wiley Subscription Services, Inc., A Wiley Company

 

数据来源: WILEY

 

摘要:

AbstractGiven a graphG=(V,E)and a setN⊆V, we consider the problem of finding a minimum‐weight multiway cut that separates each pair of nodes inN. In this paper we give an integer programming formulation of this problem and study the associated polyhedron. We give some computational results to support the strength of our facets. We also give some efficiently solvable instan

 

点击下载:  PDF (1446KB)



返 回