中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Some inverse min-max network problems under weighted l(1) and l(infinity) norms with bound constraints on changes

文献类型:期刊论文

作者Yang, Xiaoguang; Zhang, Jianzhong
刊名JOURNAL OF COMBINATORIAL OPTIMIZATION
出版日期2007-02-01
卷号13期号:2页码:123-135
关键词inverse min-max network problem weighted l(1) norm weighted l(infinity) norm bound constraints polynomial time algorithms
ISSN号1382-6905
DOI10.1007/s10878-006-9016-6
英文摘要We consider some inverse min-max (or max-min) network problems. Such an inverse problem is to modify the weights with bound constraints so that a given feasible solution becomes an optimal solution of a min-max (or max-min) network problem, and the deviation of the weights, measured by the weighted l(1) norm or weighted 1(infinity) norm, is minimum. In this paper, we present strongly polynomial time algorithms to solve the inverse min-max spanning tree problem and the inverse maximum capacity path problem.
WOS研究方向Computer Science ; Mathematics
语种英语
WOS记录号WOS:000243140800002
出版者SPRINGER
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/4527]  
专题系统科学研究所
通讯作者Yang, Xiaoguang
作者单位1.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
2.Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Hong Kong, Hong Kong, Peoples R China
推荐引用方式
GB/T 7714
Yang, Xiaoguang,Zhang, Jianzhong. Some inverse min-max network problems under weighted l(1) and l(infinity) norms with bound constraints on changes[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2007,13(2):123-135.
APA Yang, Xiaoguang,&Zhang, Jianzhong.(2007).Some inverse min-max network problems under weighted l(1) and l(infinity) norms with bound constraints on changes.JOURNAL OF COMBINATORIAL OPTIMIZATION,13(2),123-135.
MLA Yang, Xiaoguang,et al."Some inverse min-max network problems under weighted l(1) and l(infinity) norms with bound constraints on changes".JOURNAL OF COMBINATORIAL OPTIMIZATION 13.2(2007):123-135.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。