The following pages link to (Q4737541):
Displayed 21 items.
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- Optimizing busy time on parallel machines (Q476900) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- Improving LTL truck load utilization on line (Q531465) (← links)
- Resource allocation with time intervals (Q606987) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- Bicriteria scheduling for contiguous and non contiguous parallel tasks (Q940878) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities (Q1754089) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Approximations for generalized unsplittable flow on paths with application to power systems optimization (Q2678593) (← links)
- Pricing on Paths: A PTAS for the Highway Problem (Q2796210) (← links)
- Online Optimization of Busy Time on Parallel Machines (Q2898056) (← links)
- Scheduling Resources for Throughput Maximization (Q3088087) (← links)
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
- (Q5075798) (← links)
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation (Q5964827) (← links)