Solving a minisum single facility location problem in three regions with different norms
DOI10.1007/S10479-022-04952-5zbMATH Open1516.90031OpenAlexW4295681938MaRDI QIDQ6157224FDOQ6157224
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
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
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)
Cites Work
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- Title not available (Why is that?)
- Nonlinear Programming
- Location among regions with varying norms
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- A BSSS algorithm for the single facility location problem in two regions with different norms
- The Minisum and Minimax Location Problems Revisited
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Single facility location problem with region-dependent distance metrics
- GBSSS: The generalized big square small square method for planar single- facility location
- Location Theory, Dominance, and Convexity
- Location science research: a review
- Title not available (Why is that?)
- New heuristic methods for the capacitated multi-facility Weber problem
- New local searches for solving the multi-source Weber problem
- Title not available (Why is that?)
- Gate points in continuous location between regions with different \(\ell _{p}\) norms
- An Efficient Algorithm for the Solution of the Weber Problem with Mixed Norms
- LOCATING A SINGLE FACILITY IN THE PLANE IN THE PRESENCE OF A BOUNDED REGION AND DIFFERENT NORMS
- Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- Pasting gauges. I: Shortest paths across a hyperplane
- Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line
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)
