A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487)
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 New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints |
scientific article; zbMATH DE number 7548833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0 references
0.9082203
0 references
0.9039341
0 references
0.8997026
0 references
0.8956578
0 references
0.8940747
0 references
0.88847464
0 references
0.88794714
0 references
0.8878759
0 references
0.88774323
0 references
