Solving a minisum single facility location problem in three regions with different norms

DOI10.1007/S10479-022-04952-5MaRDI QIDQ6157224zbMATH OpenOpenAlexFDO

Authors G. Altay, M. Hakan Akyüz, Temel Öncan

Publication date 20 June 2023

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-022-04952-5

zbMATH Keywords

global optimizationlocationbranch-and-boundsingle facility

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Continuous location (90B85)

Recommendations

• A BSSS algorithm for the single facility location problem in two regions with different norms
• Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line
• LOCATING A SINGLE FACILITY IN THE PLANE IN THE PRESENCE OF A BOUNDED REGION AND DIFFERENT NORMS
• Single facility location problem with region-dependent distance metrics
• An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions

Cites work

• scientific article; zbMATH DE number 1803754 (Why is no real title available?)
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 1253040 (Why is no real title available?)
• A BSSS algorithm for the single facility location problem in two regions with different norms
• A primal-dual algorithm for the fermat-weber problem involving mixed gauges
• An Efficient Algorithm for the Solution of the Weber Problem with Mixed Norms
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
• Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
• GBSSS: The generalized big square small square method for planar single- facility location
• Gate points in continuous location between regions with different \(\ell _{p}\) norms
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• LOCATING A SINGLE FACILITY IN THE PLANE IN THE PRESENCE OF A BOUNDED REGION AND DIFFERENT NORMS
• Location Theory, Dominance, and Convexity
• Location among regions with varying norms
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
• Location science research: a review
• New heuristic methods for the capacitated multi-facility Weber problem
• New local searches for solving the multi-source Weber problem
• Nonlinear Programming
• Pasting gauges. I: Shortest paths across a hyperplane
• Single facility location problem with region-dependent distance metrics
• Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line
• The Minisum and Minimax Location Problems Revisited

Cited in

(3)

• Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line
• A BSSS algorithm for the single facility location problem in two regions with different norms
• An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions

This page was built for publication: Solving a minisum single facility location problem in three regions with different norms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157224)