| Titre : | A concise guide to the Traveling Salesman Problem (2011) |
| Auteurs : | G. Laporte, Auteur |
| Type de document : | Article : texte imprimé |
| Dans : | Journal of the operational research society (JORS) (Vol. 61 N° 1 (Issue spécial), Janvier 2010) |
| Article en page(s) : | pp. 35–40 |
| Note générale : | Recherche opérationnelle |
| Langues : | Anglais |
| Index. décimale : | 001.424 |
| Tags : | Traveling salesman problem Exact algorithms Heuristics Software |
| Résumé : | The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. Hundreds of papers have been written on the TSP and several exact and heuristic algorithms are available for it. Their concise guide outlines the most important and best algorithms for the symmetric and asymmetric versions of the TSP. In several cases, references to publicly available software are provided. |
| DEWEY : | 001.424 |
| ISSN : | 0160-5682 |
| En ligne : | http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors200976a.html |
