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

DOI10.1016/J.JCSS.2009.04.005MaRDI QIDQ1034103zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

\(l_p\)-normalgorithmsHamming distanceinverse optimizationisotonic regressionlower boundssorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Computing and Combinatorics
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• Adaptive sorting: an information theoretic perspective
• scientific article; zbMATH DE number 1962852
• Some inverse optimization problems under the Hamming distance

Cites work

• A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System
• A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
• Active set algorithms for isotonic regression; a unifying framework
• Algorithms in order restricted statistical inference and the Cauchy mean value property
• An O(n) algorithm for least squares quasi-convex approximation
• An optimal real-time algorithm for planar convex hulls
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Dose finding using the biased coin up-and-down design and isotonic regression
• Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems
• Finding longest increasing and common subsequences in streaming data
• scientific article; zbMATH DE number 837298 (Why is no real title available?)
• scientific article; zbMATH DE number 837302 (Why is no real title available?)
• scientific article; zbMATH DE number 3390139 (Why is no real title available?)
• Integer Isotone Optimization
• Introduction to algorithms
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse maximum flow problems under the weighted Hamming distance
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• Isotone optimization. I
• Isotone optimization. II
• Least-Squares Fitting by Monotonic Functions Having Integer Values
• Linear time algorithms for convex and monotone approximation
• Linear time isotonic and unimodal regression in the \(L_{1}\) and \(L_{\infty }\) norms
• Locally monotonic regression
• Locating service centers with precedence constraints
• Minimizing Separable Convex Functions Subject to Simple Chain Constraints
• O(n) algorithms for discrete n-point approximation by quasi-convex functions
• On computing the length of longest increasing subsequences
• Some inverse optimization problems under the Hamming distance
• The Min-Max algorithm and isotonic regression
• Weighted inverse minimum spanning tree problems under Hamming distance

Cited in

(3)

• Weighted \(L_{\infty}\) isotonic regression
• Computing and Combinatorics
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034103)