Pages that link to "Item:Q1753596"
From MaRDI portal
The following pages link to The resource dependent assignment problem with a convex agent cost function (Q1753596):
Displaying 7 items.
- A pseudo-polynomial time algorithm for solving the resource dependent assignment problem (Q2255050) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- Resource allocation problems with concave reward functions (Q2421324) (← links)
- Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning (Q2454360) (← links)
- Resource allocation problem under single resource assignment (Q4553878) (← links)
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions (Q5749161) (← links)
- Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations (Q6584755) (← links)