A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:39, 8 February 2024
scientific article; zbMATH DE number 7548833
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints |
scientific article; zbMATH DE number 7548833 |
Statements
A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (English)
0 references
27 June 2022
0 references
resource allocation
0 references
constraint relaxation
0 references
divide and conquer
0 references
polynomial-time algorithms
0 references
mixed integer convex optimization
0 references
