Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcss.2009.04.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2009.04.005 / rank | |||
Normal rank | |||
Latest revision as of 14:04, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance |
scientific article |
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
