Sándor P. Fekete, Tu Braunschweig, Henk Meijer, André Rohe, Walter Tietze, ...
An extended abstract appears in the proceedings of ALENEX’01 [Fekete et al. 2001].
Solution of a min-max vehicle routing problem (2002)
William Cook, Sanjeeb Dash, André Rohe
We use a branch-and-cut search to solve the Whizzkids’96 vehicle routing problem, demonstrating that the winning solution in the 1996 competition is in fact optimal. Our algorithmic framework...
Chained Lin-Kernighan for large traveling salesman problems (1999)
David Applegate, William Cook, André Rohe
We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained Lin-Kernighan heuristic for large-scale traveling salesman problems. Computational results are...
Computing Minimum-Weight Perfect Matchings (1998)
We make several observations on the implementation of Edmonds' blossom algorithm for solving minimum-weight perfect-matching problems and we present computational results for geometric problem...
Parallel Lower and Upper Bounds for Large TSPs (1997)
this paper we will discuss parallel versions of lower bound heuristics and iterated Lin-Kernighan. The rest of this paper is organized as follows. In Section 2 we present a heuristic to partition a...