A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
From MaRDI portal
Publication:3923523
DOI10.1137/0901037zbMath0469.65040MaRDI QIDQ3923523
Andrew R. Conn, Paul H. Calamai
Publication date: 1980
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0901037
nonsmooth optimization; multifacility location problem; Euclidean distances; minisum problem; minimax location problems
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
49K35: Optimality conditions for minimax problems
Related Items
A note on optimality conditions for the Euclidean. Multifacility location problem, Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms, A primal-dual algorithm for minimizing a sum of Euclidean norms, Weighted median algorithms for \(L_ 1\) approximation, Duality for constrained multifacility location problems with mixed norms and applications, Smoothing Newton method for minimizing the sum of \(p\) -norms, On an instance of the inverse shortest paths problem, When facilities coincide: Exact optimality conditions in multifacility location, A globally convergent algorithm for the Euclidean multiplicity location problem, Heuristic solution of the multisource Weber problem as a \(p\)-median problem, Selected bibliography on degeneracy, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, Duality theorem for a generalized Fermat-Weber problem, Discontinuous piecewise linear optimization, An improved bound for the multifacility location model, A quadratically convergent method for minimizing a sum of euclidean norms, A primal-dual algorithm for the fermat-weber problem involving mixed gauges
