Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
From MaRDI portal
Publication:1034103
DOI10.1016/j.jcss.2009.04.005zbMath1192.68199OpenAlexW2056406979MaRDI QIDQ1034103
Tzu-Chin Lin, Chung-Chin Kuo, Yong-Hsiang Hsieh, Biing-Feng Wang
Publication date: 10 November 2009
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2009.04.005
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Active set algorithms for isotonic regression; a unifying framework
- Linear time algorithms for convex and monotone approximation
- Linear time isotonic and unimodal regression in the \(L_{1}\) and \(L_{\infty }\) norms
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
- The Min-Max algorithm and isotonic regression
- An O(n) algorithm for least squares quasi-convex approximation
- Algorithms in order restricted statistical inference and the Cauchy mean value property
- Isotone optimization. II
- On computing the length of longest increasing subsequences
- Locating service centers with precedence constraints
- Weighted inverse minimum spanning tree problems under Hamming distance
- Isotone optimization. I
- Inverse combinatorial optimization: a survey on problems, methods, and results
- O(n) algorithms for discrete n-point approximation by quasi-convex functions
- Inverse maximum flow problems under the weighted Hamming distance
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Finding longest increasing and common subsequences in streaming data
- Some inverse optimization problems under the Hamming distance
- Dose Finding Using the Biased Coin Up-and-Down Design and Isotonic Regression
- A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
- Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems
- Least-Squares Fitting by Monotonic Functions Having Integer Values
- An optimal real-time algorithm for planar convex hulls
- Locally monotonic regression
- Integer Isotone Optimization
- Minimizing Separable Convex Functions Subject to Simple Chain Constraints
- A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System
This page was built for publication: Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
