Solving general continuous single facility location problems by cutting planes
- 30 April 1987
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 29 (1) , 98-110
- https://doi.org/10.1016/0377-2217(87)90198-6
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The Minisum and Minimax Location Problems RevisitedOperations Research, 1985
- On minimax optimization problemsMathematical Programming, 1982
- An improved vertex enumeration algorithmEuropean Journal of Operational Research, 1982
- Fixed Point Optimality Criteria for the Location Problem with Arbitrary NormsJournal of the Operational Research Society, 1981
- An algorithm for the minimax weber problemEuropean Journal of Operational Research, 1981
- THE LOCATION OF A CENTER‐MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE*Journal of Regional Science, 1976
- Technical Note—Location Theory: A Selective BibliographyOperations Research, 1974
- On Solving Multifacility Location Problems using a Hyperboloid Approximation ProcedureA I I E Transactions, 1973
- The Minimum Covering Sphere ProblemManagement Science, 1972
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959