Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space

John J. Bartholdi, III and Loren K. Platzman
Additional contact information
John J. Bartholdi, III: School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
Loren K. Platzman: School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332

Management Science, 1988, vol. 34, issue 3, 291-305

Abstract: 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.

Keywords: integer algorithms; heuristic (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.34.3.291 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:34:y:1988:i:3:p:291-305

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().