A new algorithm for optimal bin packing

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 731-736

  Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; HEURISTIC METHODS; NUMBER THEORY; PROBLEM SOLVING; SET THEORY;

OPTIMAL BIN PACKING;

ARTIFICIAL INTELLIGENCE;

EID: 0036923220     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Fekete, S., and Schepers, J. 1998. New classes of lower bounds for bin packing problems. In Bixby, R.; Boyd, E.; and Rios-Mercado, R., eds., Integer Programming and Combinatorial Optimization: Proceedings of the 6th International IPCO Conference, 257-270. Houston, TX: Springer.
2. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman.
3. Gent, I. 1998. Heuristic solution of open bin packing problems. Journal of Heuristics 3:299-304.
4. Johnson, D. 1973. Near-Optimal Bin Packing Algorithms. Ph.D. Dissertation, Dept. of Mathematics, M.I.T., Cambridge, MA.
5. Knuth, D. 2000. Dancing links. In Davies, J.; Roscoe, B.; and Woodcock, J., eds., Millenial Perspectives in Computer Science. Palgrave: Houndmills, Bashingstake, Hampshire. 187-214.
6. Martello, S., and Toth, P. 1990a. Bin-packing problem. In Knapsack Problems: Algorithms and Computer Implementations. Wiley. chapter 8, 221-245.
7. Martello, S., and Toth, P. 1990b. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics 28:59-70.