Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms

DOI10.1007/s10589-014-9638-zzbMath1297.90073arXiv1312.7473OpenAlexW2138729379WikidataQ58217144 ScholiaQ58217144MaRDI QIDQ457226

Justo Puerto, Víctor Blanco, Safae El-Haj Ben-Ali

Publication date: 26 September 2014

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.7473

zbMATH Keywords

moment problemsemidefinite programmingcontinuous locationordered median problems

Mathematics Subject Classification ID

Related Items (26)

On $\ell_p$-Support Vector Machines and Multidimensional Kernels ⋮ Continuous multifacility ordered median location problems ⋮ Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem ⋮ Locating hyperplanes to fitting set of points: a general framework ⋮ An exact completely positive programming formulation for the discrete ordered median problem: an extended version ⋮ Continuous maximal covering location problems with interconnected facilities ⋮ Optimal arrangements of hyperplanes for SVM-based multiclass classification ⋮ Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods ⋮ A multiple-drone arc routing and mothership coordination problem ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ Ordered \(p\)-median problems with neighbourhoods ⋮ On hub location problems in geographically flexible networks ⋮ A fresh view on the discrete ordered median problem based on partial monotonicity ⋮ Fairness in maximal covering location problems ⋮ Mathematical optimization models for reallocating and sharing health equipment in pandemic situations ⋮ Multi-type maximal covering location problems: hybridizing discrete and continuous problems ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ New models for the location of controversial facilities: a bilevel programming approach ⋮ Continuous location under the effect of `refraction' ⋮ ON THE AGGREGATION OF EXPERTS' INFORMATION IN BONUS–MALUS SYSTEMS ⋮ On the multisource hyperplanes location problem to fitting set of points ⋮ Covering problems with polyellipsoids: a location analysis perspective ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms ⋮ Minimum cost \(b\)-matching problems with neighborhoods ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem

Uses Software

• SeDuMi
• SDPT3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing ordered weighted averaging of rational functions with applications to continuous location
• Solution of location problems with radial cost functions
• On solving the planar \(k\)-centrum problem with Euclidean distances
• Local convergence in a generalized Fermat-Weber problem
• A note on the Weber location problem
• Moments and sums of squares for polynomial optimization and related problems
• Semidefinite representation of convex sets
• A general global optimization approach for solving location problems in the plane
• Convex ordered median problem with \(\ell _p\)-norms
• The single facility location problem with average-distances
• A flexible model and efficient solution strategies for discrete location problems
• Constructing a DC decomposition for ordered median problems
• Location problems with costs being sums of powers of Euclidean distances
• Accelerating convergence in the Fermat-Weber location problem
• Location of a moving service facility
• On the convergence of the Weiszfeld algorithm
• On the convergence of a modified algorithm for the spherical facility location problem
• A note on convergence in the single facility minisum location problem
• Locating tree-shaped facilities using the ordered median objective
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• Algorithmic results for ordered median problems
• Minisum location with closest Euclidean distances
• The Fermat-Weber location problem revisited
• On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
• Solving the ordered one-median problem in the plane
• Exact procedures for solving the discrete ordered median problem
• New models for locating a moving service facility
• The State-of-the-Art in Conic Optimization Software
• On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
• Location Theory
• On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization
• Weber's problem and weiszfeld's algorithm in general spaces
• Technical Note—Minisum I_p Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• On the Implementation of a Primal-Dual Interior Point Method
• Local convergence in Fermat's problem
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• A note on accelerating the weiszfeld procedure
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Multifacility ordered median problems on networks: A further analysis
• Further notes on convergence of the Weiszfeld algorithm
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
• A note on Fermat's problem
• Optimal location of a single facility with circular demand areas

This page was built for publication: Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms