Reducibility among Geometric Location-Allocation Optimization Problems
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Authors
Abstract
Three different classes of multiple points location-allocation problems in the Euclidean plane are considered under a discrete optimization criterion which minimizes the maximum cost based on certain interpoint distances. Each of these classes of geometric optimization problems is studied with three different distance metrics (Euclidean, Rectilinear, Infinity) as well as for feasible solution sets in the plane which are both discrete and infinite. All of these problems are shown to be polynomial-time reducible to each other and furthermore D^{p} complete.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1984-05
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-607
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report