| Article ID: | iaor1989442 |
| Country: | United States |
| Volume: | 23 |
| Issue: | 3 |
| Start Page Number: | 201 |
| End Page Number: | 207 |
| Publication Date: | Aug 1989 |
| Journal: | Transportation Science |
| Authors: | Drezner Zvi, Wesolowsky George O. |
In many situations the distance between two points is not a symmetric function; i.e., the distance from A to B is different from the distance from B to A. This is typical, for example, in rush hour traffic. We consider four models: the minisum or minimax problems with rectilinear or Euclidean distances. Efficient algorithms for the solution of these four problems are presented.