The Asymmetric Distance Location Problem

Zvi Drezner and George O. Wesolowsky
Additional contact information
Zvi Drezner: California State University, Fullerton, California
George O. Wesolowsky: McMaster University, Hamilton, Ontario, Canada

Transportation Science, 1989, vol. 23, issue 3, 201-207

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

Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.23.3.201 (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:ortrsc:v:23:y:1989:i:3:p:201-207

Access Statistics for this article

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