The nestedness property of the convex ordered median location problem on a tree
From MaRDI portal
Publication:783030
DOI10.1016/j.disopt.2020.100581zbMath1506.90142OpenAlexW3023218803MaRDI QIDQ783030
Publication date: 30 July 2020
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2020.100581
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cites Work
- A note on the nestedness property for ordered median problems in tree networks
- A note on the continuity of solutions of parametric linear programs
- Minimum cost flow algorithms for series-parallel networks
- On greedy algorithms for series parallel graphs
- On the continuity of the maximum in parametric linear programming
- The nestedness property of location problems on the line
- Locating tree-shaped facilities using the ordered median objective
- Minimizing the sum of the \(k\) largest functions in linear time.
- A flexible approach to location problems
- A note on the subtree ordered median problem in networks based on nestedness property
- Cores of convex games
- Location Theory
- The optimal location of a path or tree in a tree network
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
- Conditional location of path and tree shaped facilities on trees
- Matroids and the greedy algorithm
- Convex separable optimization is not much harder than linear optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item