Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space

We describe a family of heuristics to solve combinatorial problems such as routing and partitioning. These heuristics exploit geometry but ignore specific distance measures. Consequently they are simple and fast, but nonetheless fairly accurate, and so seem well-suited to operational problems where time or computing resources are limited. We survey promising new application areas, and show how procedures may be customized to reflect the structure of particular applications.

MoreLess

Year of publication:	1988
Authors:	John J. Bartholdi, III ; Platzman, Loren K.
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 34.1988, 3, p. 291-305
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	integer algorithms \| heuristic

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.34.3.291 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009214104