On Bin Packing with Conflicts
- 1 January 2007
- book chapter
- Published by Springer Nature
- p. 160-173
- https://doi.org/10.1007/11970125_13
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- An Approximation Scheme for Bin Packing with ConflictsJournal of Combinatorial Optimization, 1999
- On Local Search for Weighted k-Set PackingMathematics of Operations Research, 1998
- Approximation Algorithms for Time Constrained SchedulingInformation and Computation, 1997
- Precoloring Extension III: Classes of Perfect GraphsCombinatorics, Probability and Computing, 1996
- Repacking helps in bounded space on-line bind-packingComputing, 1993
- On‐line and first fit colorings of graphsJournal of Graph Theory, 1988
- An introduction to timetablingEuropean Journal of Operational Research, 1985
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-PackingSIAM Journal on Algebraic Discrete Methods, 1981
- Resource constrained scheduling as generalized bin packingJournal of Combinatorial Theory, Series A, 1976
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974