General spacefilling curve heuristics and limit theory for the traveling salesman problem
From MaRDI portal
Publication:1333242
DOI10.1006/jcom.1994.1011zbMath0820.90115OpenAlexW2052222222MaRDI QIDQ1333242
Publication date: 13 September 1994
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1994.1011
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)
Related Items (5)
Practical distribution-sensitive point location in triangulations ⋮ Using space filling curves to compare two multivariate distributions with distribution-free tests ⋮ The complete set of homogeneous Hilbert curves in two dimensions ⋮ Bounds for the traveling salesman paths of two-dimensional modular lattices ⋮ Nearest-neighbor graphs on the cantor set
This page was built for publication: General spacefilling curve heuristics and limit theory for the traveling salesman problem
