Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
- 1 August 1998
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 46 (4) , 548-562
- https://doi.org/10.1287/opre.46.4.548
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- WEBER'S PROBLEM WITH ATTRACTION AND REPULSION*Journal of Regional Science, 1992
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedraDiscrete & Computational Geometry, 1992
- On-line and off-line vertex enumeration by adjacency listsOperations Research Letters, 1991
- An Overview of Representative Problems in Location ResearchManagement Science, 1989
- Conditional Minisum and Minimax Location-Allocation Problems in Euclidean SpaceTransportation Science, 1988
- Solution of minisum and minimax location–allocation problems with Euclidean distancesNaval Research Logistics Quarterly, 1983
- Local Optima Avoidance in Depot LocationJournal of the Operational Research Society, 1981
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean DistancesSIAM Journal on Scientific and Statistical Computing, 1980
- Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofpInternational Journal of Systems Science, 1976
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959