Partial inverse assignment problems under l(1) norm

doi:10.1016/j.orl.2005.12.003

CSpace > 系统科学研究所

	Partial inverse assignment problems under l(1) norm
	Yang, Xiaoguang; Zhang, Jianzhong
	2007
发表期刊	OPERATIONS RESEARCH LETTERS
ISSN	0167-6377
卷号	35 期号:1 页码:23-28
摘要	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.
关键词	partial inverse optimization assignment problem polynomially solvable problems
DOI	10.1016/j.orl.2005.12.003
语种	英语
WOS研究方向	Operations Research & Management Science
WOS类目	Operations Research & Management Science
WOS记录号	WOS:000244488300004
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/4065
专题	系统科学研究所
通讯作者	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.