A Simple Algorithm for the Planar Multiway Cut Problem

Author： Yeh W-C.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.39, Iss.1, 2001-04, pp. : 68-77

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Branch-and-Cut Algorithm for the Median-Path Problem

By Avella Pasquale   Boccia Maurizio   Sforza Antonio   Vasil'Ev Igor  

Computational Optimization and Applications, Vol. 32, Iss. 3, 2005-12 ,pp. : 215-230

Springer Publishing Company

Access to resources Recommend Favorite

A simulated annealing algorithm for the maximum planar subgraph problem

By Poranen T.  

International Journal of Computer Mathematics, Vol. 81, Iss. 5, 2004-05 ,pp. : 555-568

Taylor & Francis Ltd

Access to resources Recommend Favorite

Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs

By Fan Neng  

Journal of Combinatorial Optimization, Vol. 23, Iss. 2, 2012-02 ,pp. : 224-251

Springer Publishing Company

Access to resources Recommend Favorite

The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm

By Dumitrescu Irina  

Mathematical Programming, Vol. 121, Iss. 2, 2010-02 ,pp. : 269-305

Elsevier

Access to resources Recommend Favorite

Polyhedral results and a Branch-and-cut algorithm for the [TEX equation: k] -cardinality tree problem

By Simonetti Luidi   Cunha Alexandre   Lucena Abilio  

Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. : 511-538

Elsevier

Access to resources Recommend Favorite