Time-dependent travelling salesman problem.
From MaRDI portal
Publication:2476429
DOI10.1007/BF03398730zbMath1158.90412OpenAlexW2775409252MaRDI QIDQ2476429
Publication date: 19 March 2008
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03398730
patternwordalphabet-tabletrip-scheduletourlexi-search algorithm, pattern recognition techniquetime-dependent travelling salesman problem
Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)
Related Items
A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
Cites Work
- Integer Programming Formulation of Traveling Salesman Problems
- An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The Traveling-Salesman Problem
- Production Scheduling by the Transportation Method of Linear Programming
- A Method for Solving Traveling-Salesman Problems
- An Algorithm for the Traveling Salesman Problem
- The Traveling Salesman Problem: A Survey