The traveling salesman problem: An overview of exact and approximate algorithms
G Laporte - European Journal of Operational Research, 1992 - Elsevier
The Traveling Salesman Problem: An overview of exact and approximate algorithms Page 1
European Journal of Operational Research 59 (1992) 231-247 231 North-Holland Invited …
European Journal of Operational Research 59 (1992) 231-247 231 North-Holland Invited …
Traveling salesman problem: an overview of applications, formulations, and solution approaches
The traveling salesman problem (TSP) were studied in the 18th century by a mathematician
from Ireland named Sir William Rowam Hamilton and by the British mathematician named …
from Ireland named Sir William Rowam Hamilton and by the British mathematician named …
Ant colony optimization
Swarm intelligence is a relatively new approach to problem solving that takes inspiration
from the social behaviors of insects and of other animals. In particular, ants have inspired a …
from the social behaviors of insects and of other animals. In particular, ants have inspired a …
[图书][B] Genetic algorithms and engineering optimization
A comprehensive guide to a powerful new analytical tool by two of its foremost innovators
The past decade has witnessed many exciting advances in the use of genetic algorithms …
The past decade has witnessed many exciting advances in the use of genetic algorithms …
[图书][B] Geometric algorithms and combinatorial optimization
Historically, there is a close connection between geometry and optImization. This is
illustrated by methods like the gradient method and the simplex method, which are …
illustrated by methods like the gradient method and the simplex method, which are …
An effective implementation of the Lin–Kernighan traveling salesman heuristic
K Helsgaun - European journal of operational research, 2000 - Elsevier
This paper describes an implementation of the Lin–Kernighan heuristic, one of the most
successful methods for generating optimal or near-optimal solutions for the symmetric …
successful methods for generating optimal or near-optimal solutions for the symmetric …
[图书][B] In pursuit of the traveling salesman: mathematics at the limits of computation
WJ Cook - 2015 - degruyter.com
What is the shortest possible route for a traveling salesman seeking to visit each city on a list
exactly once and return to his city of origin? It sounds simple enough, yet the traveling …
exactly once and return to his city of origin? It sounds simple enough, yet the traveling …
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
M Padberg, G Rinaldi - SIAM review, 1991 - SIAM
An algorithm is described for solving large-scale instances of the Symmetric Traveling
Salesman Problem (STSP) to optimality. The core of the algorithm is a “polyhedral” cutting …
Salesman Problem (STSP) to optimality. The core of the algorithm is a “polyhedral” cutting …
[图书][B] Combinatorial optimization: papers from the DIMACS Special Year
Combinatorial optimization: papers from the DIMACS Special Year Page 1 DIMACS Series in
Discrete Mathematics and Theoretical Computer Science Volume 20 Combinatorial …
Discrete Mathematics and Theoretical Computer Science Volume 20 Combinatorial …
[图书][B] The traveling salesman: computational solutions for TSP applications
G Reinelt - 2003 - books.google.com
Still today I am receiving requests for reprints of the book, but unfortunately it is out of print.
Therefore, since the book still seems to receive some attention, I p-posed to Springer Verlag …
Therefore, since the book still seems to receive some attention, I p-posed to Springer Verlag …