Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
Authors:
- 21 November 2006
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 36 (1) , 55-66
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Center Location Improvement Problem Under the Hamming DistanceJournal of Combinatorial Optimization, 2005
- Weighted Inverse Minimum Spanning Tree Problems Under Hamming DistanceJournal of Combinatorial Optimization, 2005
- Inverse Combinatorial Optimization: A Survey on Problems, Methods, and ResultsJournal of Combinatorial Optimization, 2004
- Solving the Convex Cost Integer Dual Network Flow ProblemManagement Science, 2003
- Minimizing a Convex Cost Closure SetSIAM Journal on Discrete Mathematics, 2003
- A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain ConstraintsOperations Research, 2001