Repacking helps in bounded space on-line bind-packing
- 1 December 1993
- journal article
- Published by Springer Nature in Computing
- Vol. 49 (4) , 329-338
- https://doi.org/10.1007/bf02248693
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Fast algorithms for bin packingPublished by Elsevier ,2007
- A simple on-line bin-packing algorithmJournal of the ACM, 1985
- 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
- On Certain Nonlinear Recurring SequencesThe American Mathematical Monthly, 1963