A NOTE ON THE NESTEDNESS PROPERTY FOR ORDERED MEDIAN PROBLEMS IN TREE NETWORKS

作     者：TANG Huajun 

作者机构：Faculty of Management and AdministrationMacao University of Science and Technology 

出 版 物：《Journal of Systems Science & Complexity》 (系统科学与复杂性学报（英文版）)

年 卷 期：2013年第26卷第3期

页      面：335-340页

核心收录：

学科分类：0810[工学-信息与通信工程] 1205[管理学-图书情报与档案管理] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the Macao Foundation under Grant No.0249 National Natural Science Foundation of China under Grant No.70901050 

主　　题：网络问题 属性表 中位数 嵌套 有序 注记 树型 位置 

摘      要：The nestedness property has become an increasingly important means for devising efficient algorithms for network location problems.There have been attempts to explore the nestedness property of network location problems with some special cases of the convex ordered median objectives.However,there is little research on the nestedness property for those problems with the concave ordered median objectives.This paper constructs a tree network T and shows that the nestedness property cannot hold for the concave ordered median problem,which fills a gap in the research on the nestedness property.Finally,the authors pose an open problem on identifying the nestedness property for the continuous strategic ordered median problem.