scientific article; zbMATH DE number 4131978

MaRDI QIDQ3033585zbMATH OpenFDO

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

Publication date 1989

zbMATH Keywords

k-optimalityparallel processingtime windowstime-constrained travelling salesman

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Sequential and parallel local search for the time-constrained traveling salesman problem
• Publication:4870332
• The parallel complexity of TSP heuristics
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem

Cited in

(5)

• New parallel randomized algorithms for the traveling salesman problem
• Sequential and parallel local search for the time-constrained traveling salesman problem
• Analysing the run-time behaviour of iterated local search for the travelling salesman problem.
• scientific article; zbMATH DE number 1304530 (Why is no real title available?)
• scientific article; zbMATH DE number 857591 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033585)