Algorithms for Travelling Salesperson Problems
A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Combinatorial Optimization, Graph, and Network Algorithms".
Deadline for manuscript submissions: closed (28 February 2021) | Viewed by 3722
Special Issue Editors
Interests: algorithms; complexity; computational geometry; recommendation algorithms
Interests: computational geometry; algorithms; compilers; programming languages
Special Issue Information
Dear Colleagues,
The Travelling Salesperson Problem (TSP) is a classical problem in Computer Science and Operations Research, with numerous applications to planning, logistics, and vehicle routing. It is also intrinsically linked to the theory of computing. The problem asks for the shortest closed tour visiting each “city” in a set of “cities” exactly once, given the distances between them. The problem is known to be NP-hard but certain natural variants (e.g., metric and geometric versions) admit good approximations.
TSP also has numerous generalizations, dealing with the computation of tours with specific properties such as visibility, mobility, and the selection of a subset of cities to visit based on constraints (group TSP).
We invite you to submit high-quality papers to this Special Issue on “Algorithms for Travelling Salesperson Problems”, covering TSP in a broad sense. The following is a (non-exhaustive) list of potential topics:
- exact algorithms for TSP and tour problems;
- approximation algorithms for TSP and tour problems;
- online algorithms for TSP and tour problems;
- geometric TSP and tour problems;
- complexity of TSP and tour problems;
- algorithms for generalized tour problems;
- applications of TSP and tour problems.
Prof. Dr. Bengt J. Nilsson
Dr. Erik Krohn
Dr. Paweł Żyliński
Guest Editors
Manuscript Submission Information
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
Keywords
- travelling salesperson problem
- exact algorithms
- approximation algorithms
- online algorithms
- complexity and NP-hardness
- parameterized complexity
