The nestedness property of location problems on the line
From MaRDI portal
Publication:1667399
DOI10.1007/s11750-018-0471-xzbMath1394.90463OpenAlexW2791881825MaRDI QIDQ1667399
Publication date: 28 August 2018
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-018-0471-x
Programming involving graphs or networks (90C35) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)
Related Items
Extensive facility location problems on networks: an updated review, The nestedness property of the convex ordered median location problem on a tree
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the nestedness property for ordered median problems in tree networks
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- Optimal algorithms for the path/tree-shaped facility location problems in trees
- A review of extensive facility location in networks
- Revisiting \(k\)-sum optimization
- Locating tree-shaped facilities using the ordered median objective
- Minimizing the sum of the \(k\) largest functions in linear time.
- Algorithmic results for ordered median problems
- A flexible approach to location problems
- A note on the subtree ordered median problem in networks based on nestedness property
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
- Location Theory
- On locating path- or tree-shaped facilities on networks
- Conditional location of path and tree shaped facilities on trees