Solving large batches of traveling salesman problems with parallel and distributed computing
| Year of publication: |
September 2017
|
|---|---|
| Authors: | Ozden, S. G. ; Smith, A. E. ; Gue, Kevin R. |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 85.2017, p. 87-96
|
| Subject: | TSP | Parallel computing | Routing | Distributed computing | Facilities design | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Computerunterstützung | Computerized method | Computernetz | Computer network | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
An Approach to Topology Design and Routing of Computer Networks
Pal, Sanjay Kumar, (2010)
-
A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
Barbosa, Luiz Henrique, (2020)
-
Zhang, Honggang, (2024)
- More ...
-
A computational software system to design order picking warehouses
Ozden, S. G., (2021)
-
Sharing clearances to improve machine layout
Zuo, X. Q., (2016)
-
The United Kingdom markets for cloves, nutmeg, mace, cinnamon and cassia
Smith, A. E., (1984)
- More ...