The indefinite period traveling salesman problem

DOI10.1016/j.ejor.2018.04.028zbMath1403.90175OpenAlexW2802661608WikidataQ129932239 ScholiaQ129932239MaRDI QIDQ724039

Mark H. Karwan, Lei Sun, Moustapha Diaby

Publication date: 25 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.028

zbMATH Keywords

combinatorial optimizationtraveling salesman problemroutingperiod TSP

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (1)

A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths

Cites Work

• Unnamed Item
• Multi-period vehicle routing problem with due dates
• Survivable networks, linear programming relaxations and the parsimonious property
• Optimizing over the subtour polytope of the travelling salesman problem
• Analyzing the Held-Karp TSP bound: A monotonicity property with application
• The ellipsoid method and its consequences in combinatorial optimization
• On approximately fair cost allocation in Euclidean TSP games
• The period traveling salesman problem: A new heuristic algorithm
• The traveling salesman problem and its variations
• Approximating the minimum tour cover of a digraph
• On the core of traveling salesman games
• Worst-case comparison of valid inequalities for the TSP
• On the complexity of the disjoint paths problem
• A variable neighborhood search heuristic for periodic routing problems
• Forty years of periodic vehicle routing
• Integer Programming Formulation of Traveling Salesman Problems
• An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: The indefinite period traveling salesman problem