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.