Solving Nonconvex Planar Location Problems by Finite Dominating Sets
- 1 October 2000
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 18 (2) , 195-210
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A flexible approach to location problemsMathematical Methods of Operations Research, 2000
- A D.C. optimization method for single facility location problemsJournal of Global Optimization, 1995
- Restricted planar location problems and applicationsNaval Research Logistics (NRL), 1995
- Mathematische Lösungsverfahren für planare Standortprobleme1995
- The convergence rate of the sandwich algorithm for approximating convex functionsComputing, 1992
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimizationJournal of Global Optimization, 1992
- Sandwich approximation of univariate convex functions with an application to separable convex programmingNaval Research Logistics (NRL), 1991
- Approximation of solutions for location problemsJournal of Optimization Theory and Applications, 1988
- Generalized Concavity1988
- Geometrical properties of the Fermat-Weber problemEuropean Journal of Operational Research, 1985