Probabilistic bounds on the k-traveling salesman problem and the traveling repairman problem
Year of publication: |
2024
|
---|---|
Authors: | Blanchard, Moïse ; Jacquillat, Alexandre ; Jaillet, Patrick |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 49.2024, 2, p. 1169-1191
|
Subject: | stochastic model applications | suboptimal algorithms | traveling salesman | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
-
The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Gutekunst, Samuel C., (2023)
-
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
Lera-Romero, Gonzalo, (2021)
- More ...
-
Endogenous control of service rates in stochastic and dynamic queuing models of airport congestion
Jacquillat, Alexandre, (2015)
-
A Passenger-Centric Approach to Air Traffic Flow Management
Jacquillat, Alexandre, (2018)
-
On-Demand Service Sharing with Collective Dynamic Pricing
Dogan, Mustafa, (2019)
- More ...