When facilities coincide: Exact optimality conditions in multifacility location
From MaRDI portal
Publication:1209505
DOI10.1016/0022-247X(92)90091-QzbMath0779.90063MaRDI QIDQ1209505
Publication date: 16 May 1993
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items (6)
Sufficient conditions for coincidence in \(\ell_ 1\)-minisum multifacility location problems ⋮ Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems ⋮ Geometric interpretation of the optimality conditions in multifacility location and applications ⋮ Some personal views on the current state and the future of locational analysis ⋮ Coincidence conditions in multifacility location problems with positive and negative weights ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower subdifferentiable functions and their minimization by cutting planes
- Correction to ``Geometric interpretation of the optimality conditions in multifacility location and applications
- Duality for constrained multifacility location problems with mixed norms and applications
- Solving general continuous single facility location problems by cutting planes
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- Geometric interpretation of the optimality conditions in multifacility location and applications
- On the Problem of Steiner
- A quadratically convergent method for minimizing a sum of euclidean norms
- A note on solving multifacility location problems involving euclidean distances
- Acceleration of the HAP approach for the multifacility location problem
- The Euclidean Multifacility Location Problem
- Technical Note—A Generalized Bounding Method for Multifacility Location Models
- Solving multifacility location problems involving euclidean distances
- Fixed Point Optimality Criteria for the Location Problem with Arbitrary Norms
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- A Trajectory Method for the Optimization of the Multi-Facility Location Problem With lp Distances
- Sufficient Conditions for Optimal Facility Locations to Coincide
- A subgradient algorithm for certain minimax and minisum problems
- A note on optimality conditions for the Euclidean. Multifacility location problem
- Link-Length Minimization in Networks
- Locating facilities in three‐dimensional space by convex programming
- Properties of a multifacility location problem involving euclidian distances
This page was built for publication: When facilities coincide: Exact optimality conditions in multifacility location
