A comparative analysis of several asymmetric traveling salesman problem formulations
T Öncan, IK Altınel, G Laporte - Computers & Operations Research, 2009 - Elsevier
In this survey, a classification of 24 asymmetric traveling salesman problem (ATSP)
formulations is presented. The strength of their LP relaxations is discussed and known …
formulations is presented. The strength of their LP relaxations is discussed and known …
A review of cutting path algorithms for laser cutters
This paper presents a review of the literature on generating cutting paths for laser cutting
machines. Firstly, the cutting path problem is defined including all relevant technical side …
machines. Firstly, the cutting path problem is defined including all relevant technical side …
[HTML][HTML] Models and algorithms for the asymmetric traveling salesman problem: an experimental comparison
This paper surveys the most effective mathematical models and exact algorithms proposed
for finding the optimal solution of the well-known Asymmetric Traveling Salesman Problem …
for finding the optimal solution of the well-known Asymmetric Traveling Salesman Problem …
Formulations for the clustered traveling salesman problem with d-relaxed priority rule
E dos Santos Teixeira, SA de Araujo - Computers & Operations Research, 2024 - Elsevier
Abstract In the classical Traveling Salesman Problem, the order in which the vertices are
visited has no restrictions. The only condition imposed is that each vertex is visited only …
visited has no restrictions. The only condition imposed is that each vertex is visited only …
Requiem for the Miller–Tucker–Zemlin subtour elimination constraints?
Abstract The Miller–Tucker–Zemlin (MTZ) Subtour Elimination Constraints (SECs) and the
improved version by Desrochers and Laporte (DL) have been and are still in regular use to …
improved version by Desrochers and Laporte (DL) have been and are still in regular use to …
A critical review of multi-hole drilling path optimization
Hole drilling is one of the major basic operations in part manufacturing. It follows without
surprise then that the optimization of this process is of great importance when trying to …
surprise then that the optimization of this process is of great importance when trying to …
[HTML][HTML] Natural and extended formulations for the time-dependent traveling salesman problem
In this paper, we present a new formulation for the Time-Dependent Traveling Salesman
Problem (TDTSP). We start by reviewing well known natural formulations with some …
Problem (TDTSP). We start by reviewing well known natural formulations with some …
[HTML][HTML] The probabilistic travelling salesman problem with crowdsourcing
We study a variant of the Probabilistic Travelling Salesman Problem arising when retailers
crowdsource last-mile deliveries to their own customers, who can refuse or accept in …
crowdsource last-mile deliveries to their own customers, who can refuse or accept in …
Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
G Pantuza Jr, MC de Souza - International Transactions in …, 2022 - Wiley Online Library
The prize collecting traveling salesman problem (PCTSP) is a generalization of the traveling
salesman problem (TSP) in which a tour starting at a root node must visit a subset of nodes …
salesman problem (TSP) in which a tour starting at a root node must visit a subset of nodes …
Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations
In this paper, we investigate the performances of 32 formulations for the multiple asymmetric
traveling salesman problem (mATSP) from the viewpoint of their tightness and solvability …
traveling salesman problem (mATSP) from the viewpoint of their tightness and solvability …