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 …
[图书][B] Tabu search
Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter great difficulty. Vitally important applications in …
world, classical methods often encounter great difficulty. Vitally important applications in …
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] 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 …
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] Network optimization: continuous and discrete models
D Bertsekas - 1998 - books.google.com
An insightful, comprehensive, and up-to-date treatment of linear, nonlinear, and
discrete/combinatorial network optimization problems, their applications, and their analytical …
discrete/combinatorial network optimization problems, their applications, and their analytical …
Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms
C Malandraki, MS Daskin - Transportation science, 1992 - pubsonline.informs.org
The time dependent vehicle routing problem (TDVRP) is defined as follows. A vehicle fleet of
fixed capacities serves customers of fixed demands from a central depot. Customers are …
fixed capacities serves customers of fixed demands from a central depot. Customers are …
[图书][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 …
[图书][B] Applied integer programming: modeling and solution
An accessible treatment of the modeling and solution of integer programming problems,
featuring modern applications and software In order to fully comprehend the algorithms …
featuring modern applications and software In order to fully comprehend the algorithms …