The parallel complexity of TSP heuristics
From MaRDI portal
Publication:4729351
DOI10.1016/0196-6774(89)90015-1zbMath0679.68086OpenAlexW2105656484MaRDI QIDQ4729351
David B. Shmoys, G. A. P. Kindervater, Jan Karel Lenstra
Publication date: 1989
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/1696
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Artificial intelligence (68T99) Eulerian and Hamiltonian graphs (05C45) Algorithms in computer science (68W99)
Related Items
Divide and conquer strategies for parallel TSP heuristics, Priority functions for the approximation of the metric TSP, Optimal in-store fulfillment policies for online orders in an omni-channel retail environment
