Approximation Algorithms for Multiple Strip Packing
From MaRDI portal
Publication:3558911
DOI10.1007/978-3-642-12450-1_4zbMath1284.68657OpenAlexW1490837809MaRDI QIDQ3558911
Marin Bougeret, Christina Otte, Pierre-Francois Dutot, Klaus Jansen, Denis Trystram
Publication date: 11 May 2010
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12450-1_4
Related Items (7)
Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ A new lower bound for online strip packing ⋮ Approximate composable truthful mechanism design ⋮ Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem ⋮ A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems ⋮ Relations between capacity utilization, minimal bin size and bin number ⋮ New upper bounds for online strip packing
This page was built for publication: Approximation Algorithms for Multiple Strip Packing
