Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems

被引：0
|
作者：
X. G. Yang
J. Z. Zhang
机构：
[1] Chinese Academy of Sciences,Academy of Mathematics and Systems Science
[2] City University of Hong Kong,Department of Mathematics
来源：
Computational Optimization and Applications | 2007年 / 36卷
关键词：
Sorting problem; Inverse problem; Partial inverse problem; Hamming distance; Permutation;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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(n2) 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.
引用
收藏
页码：55 / 66
页数：11
相关论文
共 50 条
  • [1] 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 (01) : 55 - 66
  • [2] Inverse multiple criteria sorting problem
    Vincent Mousseau
    Özgür Özpeynirci
    Selin Özpeynirci
    Annals of Operations Research, 2018, 267 : 379 - 412
  • [3] Inverse multiple criteria sorting problem
    Mousseau, Vincent
    Ozpeynirci, Ozgur
    Ozpeynirci, Selin
    ANNALS OF OPERATIONS RESEARCH, 2018, 267 (1-2) : 379 - 412
  • [4] Some new results on inverse sorting problems
    Yang, XG
    Zhang, JZ
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 985 - 992
  • [5] An interactive approach for inverse multiple criteria sorting problem
    Ozpeynirci, Ozgur
    Ozpeynirci, Selin
    Mousseau, Vincent
    JOURNAL OF MULTI-CRITERIA DECISION ANALYSIS, 2021, 28 (3-4) : 160 - 169
  • [6] Complexity of partial inverse assignment problem and partial inverse cut problem
    Yang, XG
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2001, 35 (01): : 117 - 126
  • [7] SORTING TREE, NESTLING TREE AND INVERSE PERMUTATION
    KUNDU, S
    INFORMATION PROCESSING LETTERS, 1977, 6 (03) : 94 - 96
  • [8] A decomposition based minimax regret approach for inverse multiple criteria sorting problem
    Özgür Özpeynirci
    Selin Özpeynirci
    Vincent Mousseau
    4OR, 2023, 21 : 125 - 149
  • [9] A decomposition based minimax regret approach for inverse multiple criteria sorting problem
    Ozpeynirci, Ozgur
    Ozpeynirci, Selin
    Mousseau, Vincent
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2023, 21 (01): : 125 - 149
  • [10] Partial inverse problems
    Greensite, F
    INVERSE PROBLEMS, 2006, 22 (02) : 461 - 479
12345