Pages that link to "Item:Q4194738"
From MaRDI portal
The following pages link to A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function (Q4194738):
Displaying 9 items.
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables (Q319990) (← links)
- A faster algorithm for the resource allocation problem with convex cost functions (Q491166) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
- On the continuous quadratic knapsack problem (Q1194858) (← links)
- Fair resource allocation for demands with sharp lower tail inequalities (Q2060610) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint (Q2491532) (← links)
- Bound-consistent spread constraint. Application to load balancing in nurse-to-patient assignments (Q2513745) (← links)
