Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5629240
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance |
scientific article; zbMATH DE number 5629240 |
Statements
Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (English)
0 references
10 November 2009
0 references
algorithms
0 references
inverse optimization
0 references
sorting
0 references
isotonic regression
0 references
\(l_p\)-norm
0 references
Hamming distance
0 references
lower bounds
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8628841042518616
0 references
0.804290771484375
0 references
0.7245025038719177
0 references
0.722627580165863
0 references
