Accession Number:

ADA050165

Title:

Finding Efficient Solutions for Rectilinear Distance Location Problems Efficiently.

Descriptive Note:

Research rept.,

Corporate Author:

FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING

Personal Author(s):

Report Date:

1977-04-01

Pagination or Media Count:

39.0

Abstract:

Given n planar existing facility locations, a planar new facility location X is called efficient if there is no other location Y at least as close to every existing facility as X, and strictly closer than X to at least one existing facility. An algorithm is presented which is either of order nlog n or order n depending upon how the problem is defined that constructs all efficient locations, and establish that no alternative algorithm can be of a low order. With the exception of two computational complexity results, this work is entirely self-conntained, and relies almost entirely upon simple geometrical analyses.

Subject Categories:

  • Theoretical Mathematics
  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE