Improved approximation algorithms for resource allocation
From MaRDI portal
Recommendations
Cited in
(35)- Resource allocation in bounded degree trees
- A fixed-parameter tractability result for multicommodity demand flow in trees
- Improved algorithms for resource allocation under varying capacity
- Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities
- Scheduling split intervals with non-uniform demands
- Approximations for generalized unsplittable flow on paths with application to power systems optimization
- Pricing on paths: a PTAS for the highway problem
- Online optimization of busy time on parallel machines. (Extended abstract)
- Improved algorithms for resource allocation under varying capacity
- Scheduling Resources for Throughput Maximization
- New Approximation Results for Resource Replication Problems
- An improved approximation algorithm for \textsc{Resource Allocation}
- Optimal interval scheduling with a resource constraint
- scientific article; zbMATH DE number 4149886 (Why is no real title available?)
- Improved Approximation Algorithms for Budgeted Allocations
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
- Resource allocation problem under single resource assignment
- A new approximation technique for resource-allocation problems
- Improved algorithm for resource allocation problems
- Approximation algorithm for resource allocation problems with time dependent penalties
- Optimizing busy time on parallel machines
- Online optimization of busy time on parallel machines
- Bandwidth allocation in cellular networks with multiple interferences
- The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users
- Packing cars into narrow roads: PTASs for limited supply highway
- A constant factor approximation algorithm for the storage allocation problem
- Improving LTL truck load utilization on line
- On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem
- A unified approach to approximating resource allocation and scheduling
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
- Resource allocation with time intervals
- Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
- Generic machine-learning-augmented beam search for resource-constrained shortest path reformulations of combinatorial optimization problems
- Using fractional primal-dual to schedule split intervals with demands
- Bicriteria scheduling for contiguous and non contiguous parallel tasks
This page was built for publication: Improved approximation algorithms for resource allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737541)
