Skip to main content
SpringerLink
Log in

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

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Heuberger, “Inverse optimization, a survey on problems, methods, and results,” Journal of Combinatorial Optimization, vol. 8, pp. 329–361, 2004.

    Article  MathSciNet  Google Scholar 

  2. R.K. Ahuja, D. Hochbaum, and J.B. Orlin, “Solving the convex cost integer dual network flow problem,” Management Science, vol. 49, pp. 950–964, 2003.

    Article  Google Scholar 

  3. R.K. Ahuja and J.B. Orlin, “A fast scaling algorithm for minimizing separable convex functions subject to chain constraints,” Operations Research, vol. 49, pp. 784–789, 2001.

    Article  MathSciNet  Google Scholar 

  4. Y. He, B.W. Zhang, and E.Y. Yao, “Weighted inverse minimum spanning tree problems under Hamming distance,” Journal of Combinatorial Optimization, vol. 9, pp. 91–100, 2005.

    Article  MathSciNet  Google Scholar 

  5. D.S. Hochbaum and M. Queyranne, “Minimizing a convex cost closure set,” SIAM Journal of Discrete Mathematics, vol. 16, pp. 192–207, 2003.

    Article  MathSciNet  Google Scholar 

  6. B.W. Zhang, J.Z. Zhang, and Y. He, “The center location improvement problem under the Hamming distance,” Journal of Combinatorial Optimization, vol. 9, pp. 187–198, 2005.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100080, China

    X. G. Yang

  2. Department of Mathematics, City University of Hong Kong, Hong Kong

    J. Z. Zhang

Authors
  1. X. G. Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Z. Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the Hong Kong Universities Grant Council (CERG CITYU 103105) and the National Key Research and Development Program of China (2002CB312004) and the National Natural Science Foundation of China (700221001, 70425004).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, X.G., Zhang, J.Z. Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems. Comput Optim Applic 36, 55–66 (2007). https://doi.org/10.1007/s10589-006-0394-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-006-0394-6

Keywords

Search

Navigation