中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A general model of some inverse combinatorial optimization problems and its solution method under l(infinity) norm

文献类型:期刊论文

作者Zhang, JZ; Liu, ZH
刊名JOURNAL OF COMBINATORIAL OPTIMIZATION
出版日期2002-06-01
卷号6期号:2页码:207-227
关键词path cycle mean-cycle assignment spanning tree matching matroid intersection basis
ISSN号1382-6905
英文摘要This paper proposes an optimization model and shows that most inverse combinatorial optimization problems so far discussed can be fit into this model as special cases. We propose a Newton-type algorithm for this model under l(infinity) norm. This algorithm can solve the model in strongly polynomial time if the subproblem involved is solvable in strongly polynomial time for any fixed value of the parameter appearing in the subproblem, and it is shown that most particular inverse optimization problems encountered are this kind. Therefore, through this paper we show that a large group of inverse optimization problems can be handled in a uniform way and solved in strongly polynomial time.
WOS研究方向Computer Science ; Mathematics
语种英语
WOS记录号WOS:000173468300007
出版者KLUWER ACADEMIC PUBL
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/17711]  
专题中国科学院数学与系统科学研究院
通讯作者Zhang, JZ
作者单位1.City Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China
2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Zhang, JZ,Liu, ZH. A general model of some inverse combinatorial optimization problems and its solution method under l(infinity) norm[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2002,6(2):207-227.
APA Zhang, JZ,&Liu, ZH.(2002).A general model of some inverse combinatorial optimization problems and its solution method under l(infinity) norm.JOURNAL OF COMBINATORIAL OPTIMIZATION,6(2),207-227.
MLA Zhang, JZ,et al."A general model of some inverse combinatorial optimization problems and its solution method under l(infinity) norm".JOURNAL OF COMBINATORIAL OPTIMIZATION 6.2(2002):207-227.

入库方式: OAI收割

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

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

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