Interactive Graphical Minimax Location of Multiple Facilities with General Constraints
Authors:
- 1 September 1983
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 15 (3) , 242-254
Abstract
An optimal algorithm for solving constrained minimax location problems has been previously reported, with the major limitation that only a single new service facility is allowed. Algorithmic extensions have now been developed and implemented on an advanced color-graphics system for the location of any number of new facilities to collectively serve the set of existing facilities. The minimax criterion is again considered for the optimization, and nonconvex constraint sets are permitted.Keywords
This publication has 9 references indexed in Scilit:
- Efficient Algorithms for the (Weighted) Minimum Circle ProblemOperations Research, 1982
- A Maximin Location Problem with Maximum Distance ConstraintsA I I E Transactions, 1980
- Interactive Computer Graphical Solutions of Constrained Minimax Location ProblemsA I I E Transactions, 1980
- Locating an Obnoxious Facility on a NetworkTransportation Science, 1978
- The m-Center Problem: Minimax Facility LocationManagement Science, 1977
- Minimax Multifacility Location with Euclidean DistancesTransportation Science, 1976
- Minimax Location of a Facility in a NetworkTransportation Science, 1972
- Geometrical Solutions for Some Minimax Location ProblemsTransportation Science, 1972
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a GraphOperations Research, 1964