ISSN:
1432-0541
Keywords:
Key words. Minimum capacity cuts, Experimental performance evaluation, Computational comparisons, Literate programming, Algorithm engineering.
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract. In the late eighties and early nineties, three major exciting new developments (and some ramifications) in the computation of minimum capacity cuts occurred and these developments motivated us to evaluate the old and new methods experimentally. We provide a brief overview of the most important algorithms for the minimum capacity cut problem and compare these methods both with problem instances from the literature and with problem instances originating from the solution of the traveling salesman problem by branch-and-cut.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s004539910009
