Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions (Q5749161)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4183201
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions |
scientific article; zbMATH DE number 4183201 |
Statements
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions (English)
0 references
1990
0 references
resource allocation
0 references
directed acyclic graph
0 references
precedence graph
0 references
separable convex programming
0 references
Lagrangian duality
0 references
ellipsoid method
0 references
fully- polynomial approximation scheme
0 references
0.87783396
0 references
0.87772787
0 references
0.8723618
0 references
0.86458033
0 references
0.8642497
0 references
0.86378694
0 references
0.86133945
0 references
0.8603293
0 references
0.86029553
0 references
