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

Computational Optimization and Applications

Volumn 36, Issue 1, 2007, Pages 55-66

  Yang, X G ^a   Zhang, J Z ^b  

^a CHINESE ACADEMY OF SCIENCES   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Hamming distance; Inverse problem; Partial inverse problem; Permutation; Sorting problem

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DISTANCE MEASUREMENT; PROBLEM SOLVING;

HAMMING DISTANCE; PARTIAL INVERSE PROBLEMS; PERMUTATION; SORTING PROBLEMS;

INVERSE PROBLEMS;

EID: 33845683503     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-006-0394-6     Document Type: Article

References (6)

1. C. Heuberger, "Inverse optimization, a survey on problems, methods, and results," Journal of Combinatorial Optimization, vol. 8, pp. 329-361, 2004.
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.
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.
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.
5. D.S. Hochbaum and M. Queyranne, "Minimizing a convex cost closure set," SIAM Journal of Discrete Mathematics, vol. 16, pp. 192-207, 2003.
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.