WORST-CASE ANALYSIS FOR PLANAR MATCHING AND TOUR HEURISTICS WITH BUCKETING TECHNIQUES AND SPACEFILLING CURVES

DOI10.15807/JORSJ.29.43MaRDI QIDQ3725873zbMATH OpenOpenAlexFDO

Authors Hideki Imai

Publication date 1986

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.29.43

zbMATH Keywords

combinatorial optimizationplanar matchingbucketing techniquesplanar traveling salesmanspacefilling-curveworst-case performance of heuristics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other problems of combinatorial convexity (52A37)

Recommendations

• Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
• Spacefilling curves and the planar travelling salesman problem
• scientific article; zbMATH DE number 4087452
• General spacefilling curve heuristics and limit theory for the traveling salesman problem
• Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem

Cited in

(2)

• Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
• scientific article; zbMATH DE number 3945343 (Why is no real title available?)

This page was built for publication: WORST-CASE ANALYSIS FOR PLANAR MATCHING AND TOUR HEURISTICS WITH BUCKETING TECHNIQUES AND SPACEFILLING CURVES

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