scientific article; zbMATH DE number 2086936

zbMath1049.90035MaRDI QIDQ4737541

Amit Chakrabarti, Gruia Călinescu, Yuval Rabani, Howard J. Karloff

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370401.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (21)

Improved algorithms for resource allocation under varying capacity ⋮ Online Optimization of Busy Time on Parallel Machines ⋮ Optimal interval scheduling with a resource constraint ⋮ Using fractional primal-dual to schedule split intervals with demands ⋮ Resource allocation with time intervals ⋮ Approximations for generalized unsplittable flow on paths with application to power systems optimization ⋮ Scheduling split intervals with non-uniform demands ⋮ Optimizing busy time on parallel machines ⋮ Online optimization of busy time on parallel machines ⋮ Bicriteria scheduling for contiguous and non contiguous parallel tasks ⋮ Bandwidth allocation in cellular networks with multiple interferences ⋮ Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities ⋮ A constant factor approximation algorithm for the storage allocation problem ⋮ Improving LTL truck load utilization on line ⋮ Unnamed Item ⋮ Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees ⋮ Pricing on Paths: A PTAS for the Highway Problem ⋮ Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation ⋮ Scheduling Resources for Throughput Maximization ⋮ Resource allocation in bounded degree trees ⋮ A fixed-parameter tractability result for multicommodity demand flow in trees

This page was built for publication: