0( N log N ) Algorithm for the Rectilinear Round-Trip Location Problem

Zvi Drezner
Additional contact information
Zvi Drezner: The University of Michigan-Dearborn, Dearborn, Michigan

Transportation Science, 1985, vol. 19, issue 1, 91-93

Abstract: A shorter and simpler algorithm of complexity of 0( N log N ) is presented. The results yield an algorithm for the rectilinear round-trip location problem.

Date: 1985
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.19.1.91 (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:19:y:1985:i:1:p:91-93

Access Statistics for this article

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