Knapsack Problem Online Algorithm Greedy Heuristic Multiprocessor Schedule Problem Pseudopolynomial Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


General Literature

  1. Coffman, E.G., Garey, M.R., and Johnson, D.S. [1996]: Approximation algorithms for bin-packing; a survey. In: Approximation Algorithms for NP-Hard Problems (D.S. Hochbaum, ed.), PWS, Boston, 1996Google Scholar

Cited References

  1. Baker, B.S. [1985]: A new proof for the First-Fit Decreasing bin-packing algorithm. Journal of Algorithms 6 (1985), 49–70CrossRefMathSciNetMATHGoogle Scholar
  2. Bansal, N., and Sviridenko, M. [2004]: New approximability and inapproximability results for 2-dimensional bin packing. Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (2004), 196–203Google Scholar
  3. Caprara, A. [2002]: Packing 2-dimensional bins in harmony. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (2002), 490–499Google Scholar
  4. Eisemann, K. [1957]: The trim problem. Management Science 3 (1957), 279–284MathSciNetMATHGoogle Scholar
  5. Fernandez de la Vega, W., and Lueker, G.S. [1981]: Bin packing can be solved within 1 + ∈ in linear time. Combinatorica 1 (1981), 349–355MathSciNetMATHGoogle Scholar
  6. Garey, M.R., Graham, R.L., Johnson, D.S., and Yao, A.C. [1976]: Resource constrained scheduling as generalized bin packing. Journal of Combinatorial Theory A 21 (1976), 257–298MathSciNetMATHGoogle Scholar
  7. Garey, M.R., and Johnson, D.S. [1975]: Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing 4 (1975), 397–411MathSciNetMATHGoogle Scholar
  8. Garey, M.R., and Johnson, D.S. [1979]: Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman, San Francisco 1979, p. 127Google Scholar
  9. Gilmore, P.C., and Gomory, R.E. [1961]: A linear programming approach to the cuttingstock problem. Operations Research 9 (1961), 849–859MathSciNetMATHGoogle Scholar
  10. Graham, R.L. [1966]: Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal 45 (1966), 1563–1581Google Scholar
  11. Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G. [1979]: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Discrete Optimization II; Annals of Discrete Mathematics 5 (P.L. Hammer, E.L. Johnson, B.H. Korte, eds.), North-Holland, Amsterdam 1979, pp. 287–326Google Scholar
  12. Hochbaum, D.S., and Shmoys, D.B. [1987]: Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM 34 (1987), 144–162CrossRefMathSciNetGoogle Scholar
  13. Horowitz, E., and Sahni, S.K. [1976]: Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM 23 (1976), 317–327MathSciNetMATHGoogle Scholar
  14. Johnson, D.S. [1973]: Near-Optimal Bin Packing Algorithms. Doctoral Thesis, Dept. of Mathematics, MIT, Cambridge, MA, 1973Google Scholar
  15. Johnson, D.S. [1974]: Fast algorithms for bin-packing. Journal of Computer and System Sciences 8 (1974), 272–314MathSciNetMATHGoogle Scholar
  16. Johnson, D.S. [1982]: The NP-completeness column; an ongoing guide. Journal of Algorithms 3 (1982), 288–300, Section 3MathSciNetMATHGoogle Scholar
  17. Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., and Graham, R.L. [1974]: Worstcase performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3 (1974), 299–325CrossRefMathSciNetGoogle Scholar
  18. Karmarkar, N., and Karp, R.M. [1982]: An efficient approximation scheme for the one-dimensional bin-packing problem. Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (1982), 312–320Google Scholar
  19. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B. [1993]: Sequencing and scheduling: algorithms and complexity. In: Handbooks in Operations Research and Management Science; Vol. 4 (S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin, eds.), Elsevier, Amsterdam 1993Google Scholar
  20. Lenstra, H.W. [1983]: Integer Programming with a fixed number of variables. Mathematics of Operations Research 8 (1983), 538–548MathSciNetMATHGoogle Scholar
  21. Papadimitriou, C.H. [1994]: Computational Complexity. Addison-Wesley, Reading 1994, pp. 204–205MATHGoogle Scholar
  22. Plotkin, S.A., Shmoys, D.B., and Tardos, É. [1995] Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20 (1995), 257–301MathSciNetCrossRefMATHGoogle Scholar
  23. Seiden, S.S. [2002]: On the online bin packing problem. Journal of the ACM 49 (2002), 640–671CrossRefMathSciNetGoogle Scholar
  24. Simchi-Levi, D. [1994]: New worst-case results for the bin-packing problem. Naval Research Logistics 41 (1994), 579–585MathSciNetMATHGoogle Scholar
  25. van Vliet, A. [1992]: An improved lower bound for on-line bin packing algorithms. Information Processing Letters 43 (1992), 277–284MathSciNetMATHGoogle Scholar
  26. Yue, M. [1990]: A simple proof of the inequality F F D(L) ≤ 11/9 OPT(L)+1, ∀ L for the FFD bin-packing algorithm. Report No. 90665, Research Institute for Discrete Mathematics, University of Bonn, 1990Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Personalised recommendations