The nestedness property of the convex ordered median location problem on a tree

DOI10.1016/J.DISOPT.2020.100581MaRDI QIDQ783030zbMATH OpenOpenAlexFDO

Authors Mark Rozanov, Arie Tamir

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

zbMATH Keywords

convex ordered medianextensive facilitygraph optimizationlocation theorynestedness

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Recommendations

• A note on the subtree ordered median problem in networks based on nestedness property
• The nestedness property of location problems on the line
• A note on the nestedness property for ordered median problems in tree networks
• Locating tree-shaped facilities using the ordered median objective
• Conditional location of path and tree shaped facilities on trees

Cites work

• A flexible approach to location problems
• A note on the continuity of solutions of parametric linear programs
• A note on the nestedness property for ordered median problems in tree networks
• A note on the subtree ordered median problem in networks based on nestedness property
• Conditional location of path and tree shaped facilities on trees
• Convex separable optimization is not much harder than linear optimization
• Cores of convex games
• scientific article; zbMATH DE number 3653840 (Why is no real title available?)
• scientific article; zbMATH DE number 9246 (Why is no real title available?)
• scientific article; zbMATH DE number 1091558 (Why is no real title available?)
• scientific article; zbMATH DE number 1859298 (Why is no real title available?)
• scientific article; zbMATH DE number 3275139 (Why is no real title available?)
• Locating tree-shaped facilities using the ordered median objective
• Location theory. A unified approach
• Matroids and the greedy algorithm
• Minimizing the sum of the \(k\) largest functions in linear time.
• 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 Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• The nestedness property of location problems on the line
• The optimal location of a path or tree in a tree network

Cited in

(5)

• The nestedness property of location problems on the line
• A note on the subtree ordered median problem in networks based on nestedness property
• A note on the nestedness property for ordered median problems in tree networks
• An inverse approach to convex ordered median problems in trees
• Polyhedral properties of the \(K\)-median problem on a tree

This page was built for publication: The nestedness property of the convex ordered median location problem on a tree

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