中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems

文献类型:期刊论文

作者Yang, X. G.; Zhang, J. Z.
刊名COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
出版日期2007
卷号36期号:1页码:55-66
关键词sorting problem inverse problem partial inverse problem hamming distance permutation
ISSN号0926-6003
DOI10.1007/s10589-006-0394-6
英文摘要In this paper, we consider two types of inverse sorting problems. The first type is an inverse sorting problem by minimizing the total weighted number of changes with bound constraints. We present an O(n(2)) time algorithm to solve the problem. The second type is a partial inverse sorting problem and a variant of the partial inverse sorting problem. We show that both the partial inverse sorting problem and the variant can be solved by a combination of a sorting problem and an inverse sorting problem.
WOS研究方向Operations Research & Management Science ; Mathematics
语种英语
WOS记录号WOS:000246272900003
出版者SPRINGER
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/4161]  
专题中国科学院数学与系统科学研究院
通讯作者Yang, X. G.
作者单位1.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
2.City Univ Hong Kong, Dept Math, Hong Kong, Peoples R China
推荐引用方式
GB/T 7714
Yang, X. G.,Zhang, J. Z.. Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS,2007,36(1):55-66.
APA Yang, X. G.,&Zhang, J. Z..(2007).Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems.COMPUTATIONAL OPTIMIZATION AND APPLICATIONS,36(1),55-66.
MLA Yang, X. G.,et al."Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems".COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 36.1(2007):55-66.

入库方式: OAI收割

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

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

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