Jill Cirasella, David S. Johnson, Lyle A. Mcgeoch, Weixiong Zhang
The purpose of this paper is to provide the first broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP). There are currently three general...
Jill Cirasella, David S. Johnson, Lyle A. Mcgeoch, Weixiong Zhang
Abstract. The purpose of this paper is to provide a preliminary report on the first broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP)....
Experimental Analysis of Heuristics for the STSP (2007)
David S. Johnson, Lyle A. McGeoch
In this and the following chapter, we consider what approaches one should take when one is confronted with a real-world application of the TSP. What algorithms should be used under which...
Jill Cirasella, David S. Johnson, Lyle A. Mcgeoch, Weixiong Zhang
Abstract. The purpose of this paper is to provide a preliminary report on the first broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP)....
McGeoch , "The Traveling Salesman Problem: A Case Study in Local Optimization (2007)
David S. Johnson, Gregory Gutin, Lyle A. Mcgeoch, Anders Yeo, Weixiong Zhang, Alexei Zverovitch
1 2 THE TRAVELING SALESMAN PROBLEM AND ITS VARIATIONS
Competitive Paging Algorithms Amos Fiat 1 (2007)
Richard M. Karp, Michael Luby, Lyle A. Mcgeoch, Daniel D. Sleator, Neal E. Young
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. We develop the marking algorithm, a randomized on-line algorithm for...
The asymmetric traveling salesman problem: algorithms, instance generators and tests (2001)
Jill Cirasella, David S. Johnson, Lyle A. Mcgeoch, Weixiong Zhang
Abstract. The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP). There...
David S. Johnson, Lyle A. Mcgeoch
This is a preliminary version of a chapter that appeared in the book Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra (eds.), John Wiley and Sons, London, 1997, pp....
David S. Johnson, Lyle A. Mcgeoch
This is a preliminary version of a chapter that appeared in the book Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra (eds.), John Wiley and Sons, London, 1997, pp....
David S. Johnson, Lyle A. Mcgeoch
This is a preliminary version of a chapter that appeared in the book Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra (eds.), John Wiley and Sons, London, 1997, pp....
David S. Johnson, Cecilia R. Aragon, Lyle A. Mcgeoch, Catherine Schevon
This is the second in a series of three papers that empirically examine the competitiveness of simulated annealing in certain well-studied domains of combinatorial optimization. Simulated annealing...
JOURNAL OF ALGORITHMS 12,685-699 (1991) Competitive Paging Algorithms (1988)
Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. Mcgeoch, Daniel D. Sleator, Neal E. Young
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. We develop the marking algorithm, a randomized on-line algorithm for...
Mark S. Manasse, Lyle A. Mcgeoch, Daniel D. Sleator
The k-server problem is that of planning the motion of k mobile servers on the vertices of a graph under a sequence of requests for service. Each request consists of the name of a vertex, and is...