An \(O(n^ 3\log n)\) strong polynomial algorithm for an isotonic regression knapsack problem (Q1321426)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An \(O(n^ 3\log n)\) strong polynomial algorithm for an isotonic regression knapsack problem |
scientific article; zbMATH DE number 557902
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^ 3\log n)\) strong polynomial algorithm for an isotonic regression knapsack problem |
scientific article; zbMATH DE number 557902 |
Statements
An \(O(n^ 3\log n)\) strong polynomial algorithm for an isotonic regression knapsack problem (English)
0 references
27 April 1994
0 references
optimality conditions
0 references
Lagrange function
0 references
breakpoints
0 references
maximal cuts
0 references
active sets
0 references
isotonic regression knapsack
0 references
Karush-Kuhn-Tucker conditions
0 references
Lagrange multiplier
0 references
strong polynomial time
0 references
