Online variable-sized bin packing with conflicts
- 1 May 2011
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 8 (2) , 333-343
Abstract
No abstract availableKeywords
Funding Information
- Danish Natural Science Research Council
This publication has 12 references indexed in Scilit:
- Parametric Packing of Selfish Items and the Subset Sum AlgorithmLecture Notes in Computer Science, 2009
- Scheduling Jobs on Grid ProcessorsAlgorithmica, 2008
- On Bin Packing with ConflictsSIAM Journal on Optimization, 2008
- Worst-case analysis of the subset sum algorithm for bin packingOperations Research Letters, 2004
- A new version of on-line variable-sized bin packingDiscrete Applied Mathematics, 1997
- Approximation Algorithms for Time Constrained SchedulingInformation and Computation, 1997
- Graph coloring problemsChoice Reviews Online, 1995
- Approximation Algorithms for Bin Packing Problems: A Survey1981
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974
- Fast algorithms for bin packingJournal of Computer and System Sciences, 1974