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

Authors:
X. G. Yang;J. Z. Zhang
Affiliations:
Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China 100080;Department of Mathematics, City University of Hong Kong, Hong Kong
Venue:
Computational Optimization and Applications
Year:
2007

Citing 3
Cited 3

Minimizing a Convex Cost Closure Set

SIAM Journal on Discrete Mathematics
A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints

Operations Research
Solving the Convex Cost Integer Dual Network Flow Problem

Management Science

Efficient algorithms for the inverse sorting problem with bound constraints under the l∞-norm and the Hamming distance

Journal of Computer and System Sciences
Weighted inverse minimum cut problem under the sum-type hamming distance

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Weighted inverse maximum perfect matching problems under the Hamming distance

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

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.