| Article ID: | iaor20051040 |
| Country: | Netherlands |
| Volume: | 131 |
| Issue: | 1 |
| Start Page Number: | 203 |
| End Page Number: | 213 |
| Publication Date: | Oct 2004 |
| Journal: | Annals of Operations Research |
| Authors: | Martello Silvano, Vigo Daniele, Lodi Andrea |
| Keywords: | sets |
We present a computer code that implements a general Tabu Search technique for the solution of two- and three-dimensional bin packing problems, as well as virtually any of their variants requiring the minimization of the number of bins. The user is only requested to provide a procedure that gives an approximate solution to the actual variant to be solved.