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

DOI10.15807/JORSJ.29.43zbMath0594.90063OpenAlexW2142055878MaRDI QIDQ3725873

Hiroshi 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)

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