Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
From MaRDI portal
Publication:1187370
DOI10.1007/BF00121302zbMath0778.90067MaRDI QIDQ1187370
Publication date: 13 August 1992
Published in: Journal of Global Optimization (Search for Journal in Brave)
single facility locationpolyhedral annexationcompact level setsgauge distance functionssum of certain composite functions
Convex programming (90C25) Continuous location (90B85) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (4)
LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION ⋮ A d.c. optimization method for single facility location problems ⋮ Outer approximation algorithms for canonical DC problems ⋮ A fractional model for locating semi-desirable facilities on networks
Cites Work
- Geometrical properties of the Fermat-Weber problem
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- On-line and off-line vertex enumeration by adjacency lists
- Approximation of solutions for location problems
- Some Properties of Location Problems with Block and Round Norms
- Unnamed Item
- Unnamed Item
This page was built for publication: Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
