The nestedness property of the convex ordered median location problem on a tree.
Discrete Optimization(2020)
摘要
This paper deals with the problem of locating an extensive facility of restricted length within a given tree network. Topologically, the selected extensive facility is a subtree. The nestedness property means that a solution of a problem with a shorter length constraint is part of a solution of the same problem with a longer length constraint. We prove the existence of a nestedness property for a common family of convex ordered median (COM) objective functions. We start with the proof of the nestedness property for a rooted tree problem, where the extended facility is a subtree of some tree network rooted at a specified node, and proceed to prove the nestedness property for the general location model on a tree.
更多查看译文
关键词
Nestedness,Location theory,Extensive facility,Convex ordered median,Graph optimization
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要