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 |
DOI | 10.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 |
语种 | 英语 |
出版者 | SPRINGER |
WOS记录号 | WOS:000243140800002 |
内容类型 | 期刊论文 |
源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. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论