Backup multifacility location problem with \(l_p\) norm
From MaRDI portal
Publication:260687
DOI10.1007/s12597-014-0180-7zbMath1332.90144OpenAlexW2026525316MaRDI QIDQ260687
Publication date: 22 March 2016
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-014-0180-7
Related Items (2)
Optimizing fortification plan of capacitated facilities with maximum distance limits ⋮ Introducing capacities in the location of unreliable facilities
Cites Work
- Unnamed Item
- Backup 2-center on interval graphs
- A BSSS algorithm for the location problem with minimum square error
- A generalized Weiszfeld method for the multi-facility location problem
- The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
- Reliable Facility Location Design Under the Risk of Disruptions
- Technical Note—Minisum Ip 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
- Minimax regret p-center location on a network with demand uncertainty
- Minmax-regret robust 1-median location on a tree
- The backup 2‐center and backup 2‐median problems on trees
- Link-Length Minimization in Networks
This page was built for publication: Backup multifacility location problem with \(l_p\) norm
