Pages that link to "Item:Q491166"
From MaRDI portal
The following pages link to A faster algorithm for the resource allocation problem with convex cost functions (Q491166):
Displaying 7 items.
- An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← links)
- A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables (Q1753593) (← links)
- Fair resource allocation for demands with sharp lower tail inequalities (Q2060610) (← links)
- A decomposition algorithm for nested resource allocation problems (Q2810553) (← links)
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions (Q5749161) (← links)