Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
type: Item
instance of: scholarly article
title: Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
zbMATH Open document ID: 1192.68199
author: Tzu-Chin Lin
author: Chung-Chin Kuo
author: Yong-Hsiang Hsieh
author: Biing-Feng Wang
published in: Journal of Computer and System Sciences
publication date: 2009-11-10T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5629240
zbMATH Keywords: algorithms
zbMATH Keywords: inverse optimization
zbMATH Keywords: sorting
zbMATH Keywords: isotonic regression
zbMATH Keywords: \(l_p\)-norm
zbMATH Keywords: Hamming distance
zbMATH Keywords: lower bounds
MaRDI profile type: Publication
full work available at URL: j.jcss.2009.04.005
OpenAlex ID: W2056406979
cites work: A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
cites work: Q4863586
cites work: Q5658961
cites work: Active set algorithms for isotonic regression; a unifying framework
cites work: Minimizing Separable Convex Functions Subject to Simple Chain Constraints
cites work: Q4863587
cites work: Linear time isotonic and unimodal regression in the \(L_{1}\) and \(L_{\infty }\) norms
cites work: Introduction to algorithms
cites work: Some inverse optimization problems under the Hamming distance
cites work: On computing the length of longest increasing subsequences
cites work: Least-Squares Fitting by Monotonic Functions Having Integer Values
cites work: Weighted inverse minimum spanning tree problems under Hamming distance
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Locating service centers with precedence constraints
cites work: The Min-Max algorithm and isotonic regression
cites work: Finding longest increasing and common subsequences in streaming data
cites work: Integer Isotone Optimization
cites work: Inverse maximum flow problems under the weighted Hamming distance
cites work: Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems
cites work: An optimal real-time algorithm for planar convex hulls
cites work: Locally monotonic regression
cites work: Algorithms in order restricted statistical inference and the Cauchy mean value property
cites work: A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System
cites work: Dose Finding Using the Biased Coin Up-and-Down Design and Isotonic Regression
cites work: An O(n) algorithm for least squares quasi-convex approximation
cites work: Isotone optimization. I
cites work: Isotone optimization. II
cites work: Linear time algorithms for convex and monotone approximation
cites work: O(n) algorithms for discrete n-point approximation by quasi-convex functions
cites work: Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
cites work: Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
DOI: 10.1016/J.JCSS.2009.04.005
description: scientific article; zbMATH DE number 5629240