Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem

DOI10.1016/0167-6377(93)90082-RzbMath0771.90096MaRDI QIDQ2367039

A. R. Warburton

Publication date: 16 August 1993

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

insertion algorithmsworst-case analysisconvex hull insertion heuristicsEuclidean travelling salesmantight worst case performance analysis

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem

Cites Work

• Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem