k-Interchange procedures for local search in a precedence-constrained routing problem
- 31 August 1983
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 13 (4), 391-402
- https://doi.org/10.1016/0377-2217(83)90099-1
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problemTransportation Research Part B: Methodological, 1983
- Local Search for the Asymmetric Traveling Salesman ProblemOperations Research, 1980
- A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride ProblemTransportation Science, 1980
- Some Examples of Difficult Traveling Salesman ProblemsOperations Research, 1978
- An Asymptotic, Probabilistic Analysis of a Routing ProblemMathematics of Operations Research, 1978
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965