Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
From MaRDI portal
Publication:885822
DOI10.1007/s10589-006-0394-6zbMath1278.90348OpenAlexW2043555187MaRDI QIDQ885822
Xiao-guang Yang, Zhang, Jianzhong
Publication date: 14 June 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-0394-6
Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)
Related Items (16)
Algorithm for constraint partial inverse matroid problem with weight increase forbidden ⋮ Algorithms for the partial inverse matroid problem in which weights can only be increased ⋮ Capacity inverse minimum cost flow problems under the weighted Hamming distance ⋮ Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm ⋮ Approximation algorithms for capacitated partial inverse maximum spanning tree problem ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ A branch-and-bound algorithm for instrumental variable quantile regression ⋮ Weighted inverse maximum perfect matching problems under the Hamming distance ⋮ Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm ⋮ The partial inverse minimum spanning tree problem when weight increase is forbidden ⋮ Inverse minimum flow problem under the weighted sum-type Hamming distance ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Inverse minimum cost flow problems under the weighted Hamming distance ⋮ Constrained inverse minimum flow problems under the weighted Hamming distance ⋮ Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance ⋮ Partial inverse maximum spanning tree problem under the Chebyshev norm
Cites Work
- Weighted inverse minimum spanning tree problems under Hamming distance
- The center location improvement problem under the Hamming distance
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Solving the Convex Cost Integer Dual Network Flow Problem
- A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
- Minimizing a Convex Cost Closure Set
This page was built for publication: Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
