PERFORMANCE GUARANTEES FOR A PLOTTER OPTIMIZATION HEURISTIC.

被引：0

作者：

Eades, Peter ^{[1
]}

Wormald, Nicholas C. ^{[1
]}

机构：

[1] Univ of Queensland, Univ of Queensland

来源：

INFOR: Information Systems and Operational Research | 1987年 / 25卷 / 04期

关键词：

COMPUTER PROGRAMMING - Algorithms - MATHEMATICAL PROGRAMMING - OPTIMIZATION;

D O I：

10.1080/03155986.1987.11732047

中图分类号：

学科分类号：

摘要：

The problem of reducing the pen-up time of a plotter is related to a geometric version of the traveling salesman problem. Various greedy heuristics for the traveling salesman problem can be supplied to the plotter problem. In this paper we prove performance guarantees for one of the simplest heuristics.

引用

页码：314 / 319