A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476)
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: A breakpoint search approach for convex resource allocation problems with bounded variables |
scientific article; zbMATH DE number 6111725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A breakpoint search approach for convex resource allocation problems with bounded variables |
scientific article; zbMATH DE number 6111725 |
Statements
A breakpoint search approach for convex resource allocation problems with bounded variables (English)
0 references
30 November 2012
0 references
multiplier search
0 references
pegging
0 references
0 references
0 references
0 references
0.8136211633682251
0 references
0.7971153855323792
0 references
0.7823777198791504
0 references
0.7793084979057312
0 references
0.7759986519813538
0 references
