A BSSS algorithm for the single facility location problem in two regions with different norms

DOI10.1016/J.EJOR.2007.06.004zbMath1146.90465OpenAlexW2061248758MaRDI QIDQ2482820

Yanyan Li

Publication date: 24 April 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.004

zbMATH Keywords

global optimizationbranch and boundcontinuous locationsingle facility

Mathematics Subject Classification ID

Continuous location (90B85) Nonconvex programming, global optimization (90C26)

Related Items (10)

A generalized Weber problem with different gauges for different regions ⋮ A BSSS algorithm for the location problem with minimum square error ⋮ Solving a minisum single facility location problem in three regions with different norms ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ Support vector machines for classification of input vectors with different metrics ⋮ Gate points in continuous location between regions with different \(\ell _{p}\) norms ⋮ Pasting gauges. I: Shortest paths across a hyperplane ⋮ Fixed gate point location problems ⋮ Continuous location under the effect of `refraction' ⋮ Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• GBSSS: The generalized big square small square method for planar single- facility location
• Location among regions with varying norms
• Constrained location of competitive facilities in the plane
• The Minisum and Minimax Location Problems Revisited
• Single facility location problem with region-dependent distance metrics
• Linear Programming
• LOCATING A SINGLE FACILITY IN THE PLANE IN THE PRESENCE OF A BOUNDED REGION AND DIFFERENT NORMS

This page was built for publication: A BSSS algorithm for the single facility location problem in two regions with different norms