haku: @author Bartholdi, J. J. / yhteensä: 7
viite: 4 / 7
| Tekijä: | Bartholdi, J. J. Platzman, L. K. |
| Otsikko: | Heuristics based on spacefilling curves for combinational problems in Euclidean space. |
| Lehti: | Management Science
1988 : MAR, VOL. 34:3, p. 291-305 |
| Asiasana: | HEURISTIC METHODS INTEGER PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | There is described 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. They seem well-suited to operational problems where time or computing resources are limited. The tool described is naturally suited to solving combinatorial problems in Euclidean space. It is more than an algorithm:it is a very general technique for quickly solving hard problems. |
SCIMA