Sequential and parallel local search for the time-constrained traveling salesman problem

DOI10.1016/0166-218X(93)90047-RzbMath0780.90102MaRDI QIDQ1803676

Jan Karel Lenstra, G. A. P. Kindervater, Savelsbergh, Martin W. P.

Publication date: 29 June 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

traveling salesmanlocal searchtime windowslocal optimalitysequential and parallel algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Parallel numerical computation (65Y05)

Related Items

Parallel local search

Cites Work

• How easy is local search?
• Binary Trees and Parallel Scheduling Algorithms
• Computer Solutions of the Traveling Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item