中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Partial inverse assignment problems under l(1) norm

文献类型:期刊论文

作者Yang, Xiaoguang; Zhang, Jianzhong
刊名OPERATIONS RESEARCH LETTERS
出版日期2007
卷号35期号:1页码:23-28
关键词partial inverse optimization assignment problem polynomially solvable problems
ISSN号0167-6377
DOI10.1016/j.orl.2005.12.003
英文摘要In this paper, we consider the partial inverse assignment problem under 11 norm without bound constraints. We show that the partial inverse problem can be solved by a strongly polynomial algorithm. The technique for solving this problem can be extended to handle a special type of partial inverse 0-1 combinatorial optimization problems. (c) 2006 Elsevier B.V. All rights reserved.
WOS研究方向Operations Research & Management Science
语种英语
WOS记录号WOS:000244488300004
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/4064]  
专题系统科学研究所
通讯作者Zhang, Jianzhong
作者单位1.City Univ Hong Kong, Dept Math, Kowloon, Hong Kong, Peoples R China
2.Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Hong Kong, Hong Kong, Peoples R China
3.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Yang, Xiaoguang,Zhang, Jianzhong. Partial inverse assignment problems under l(1) norm[J]. OPERATIONS RESEARCH LETTERS,2007,35(1):23-28.
APA Yang, Xiaoguang,&Zhang, Jianzhong.(2007).Partial inverse assignment problems under l(1) norm.OPERATIONS RESEARCH LETTERS,35(1),23-28.
MLA Yang, Xiaoguang,et al."Partial inverse assignment problems under l(1) norm".OPERATIONS RESEARCH LETTERS 35.1(2007):23-28.

入库方式: OAI收割

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

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

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