Fast Algorithms for the Round Trip Location Problem |
| |
Authors: | Zvi Drezner |
| |
Affiliation: | a School of Management, The University of Michigan-Dearborn, Dearborn, Michigan |
| |
Abstract: | This paper presents several fast algorithms for the round trip location problem. I show how to simplify the method given in an article by Chan and Hearn in which only the rectilinear case is addressed and get an algorithm with improved complexity for a given accuracy. An exact solution algorithm (the complexity of which is unknown) that solved test data problems even faster is presented and generalized for Euclidean and ℓp distances. Computational results are also presented. |
| |
Keywords: | |
本文献已被 InformaWorld 等数据库收录! |
|