On-line Bin PackingUniversity of California, San Diego, Department of Electrical Engineering/Computer Science, 1989 - 94 pages |
From inside the book
Try this search over all volumes: advisor Hu
Results 1-0 of 0
Contents
A Class of Bin Packing Heuristics | 9 |
The Main Result | 18 |
Analysis of Ho | 30 |
Copyright | |
1 other sections not shown
Common terms and phrases
82 items a₁ analysis approximation algorithms asymptotic analysis B₁ items bin packing problem Bin-Packing BRARY CALIFO CALIFORN class j items Combinatorial Optimization Computer Science Cutting Stock Problem D. S. Johnson define DIEGO THE LIBRARY Discrete Mathematics Dynamic Storage Allocation E. G. Coffman elementary fact ERSITY OF CALIFORNIA graph coloring hard list input INVS item class Lemma LIBRARY SAN DIEGO LIBRARY THE UNIVE LIBRARY THE UNIVERSITY LIBRARY UNIVERSITY linear programming Lopt lower bound M. R. Garey NP-complete number of bins number of pure off-line on-line algorithms On-Line Bin Packing on-line heuristics on-line packing ORNIA Packing Algorithms packing problem packing rule partitions performance bound performance ratio pure 82 bins pure bins R. M. Karp SAN DIEGO ERSITY SAN DIEGO LIBRARY SAN DIEGO UNIVERSITY SIAM small items ẞ₁ subroutine total number UNIV DIEGO UNIV ERSITY UNIVE SAN DIEGO UNIVERSITY LIBRARY UNIVERSITY THE LIBRARY worst-case Z₁