1 |
J. E. Beasley, Algorithms for unconstrained two-dimensional guillotine cutting, Journal of Operational Research Society, Vol.36, pp.297-306.
DOI
|
2 |
E. Hadjiconstantinou and N. Christofides, An Exact algorithm for general, orthogonal, two-dimensional knapsack problem, European Journal of Operational Research, Vol.83, pp.39-56, 1995.
DOI
ScienceOn
|
3 |
A. Lodi, S. Martello, and D. Vigo, Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem, in: S. Martello, I. H. Osman, C. Roucairol (Eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, pp.125-139, 1998.
|
4 |
B. E. Bengtsson, Packing rectangular pieces-a heuristic approach, The Computer Journal Vol.25, No.3, pp.353-357, 1982
DOI
ScienceOn
|
5 |
J. O. Berkey and P. Y. Wang, Two dimensional finite bin packing algorithms Journal of the Operational Research Society 38, pp.423-429, 1987.
DOI
|
6 |
M. Dell'Amico, S. Martello and D. Vigo, A lower bound for the non-oriented two-dimensional bin packing problem, Discrete Applied Mathematics, Vol.118, pp.13-24, 2002.
DOI
ScienceOn
|
7 |
M. Dell'Amico and S. Martello, Optimal scheduling of tasks on identical parallel processors, ORSA Journal on Computing, Vol.7, No.2, pp.191-200, 1995.
DOI
ScienceOn
|
8 |
J. E. Beasley, An exact two-dimensional non-guillotine cutting tree search procedure, Operations Research, Vol.33, pp.49-64, 1985.
DOI
ScienceOn
|
9 |
N. Christofides and C. Whitlock, An algorithm for twodimensional cutting problrems, Operations Research, Vol.25, pp.30-44, 1977.
DOI
ScienceOn
|
10 |
F. K. R. Chung, M. R. Garey and D. S. Johnson, On Packing two-dimensional bins, SIAM Journal of Algebraic and Discrete Methods, Vol.3, No.1, pp.66-76, 1982.
DOI
|
11 |
H. Dyckhoff, A typology of cutting and packing problems, European Journal of Operational Research, Vol.44, No.2, pp. 145-159, 1990.
DOI
ScienceOn
|
12 |
H. Dyckhoff and G. Finke, Cutting and packing in production and distribution, Physica Verlag, Heidelberg, 1992.
|
13 |
A. El-Bouri, N. Popplewell, S. Balakrishnan and A. Alfa, A search based heuristic for the two-dimensional bin-packing problem, INFOR, Vol.32, No.4, pp.265-274, 1994.
|
14 |
A. Lodi, S. Martello, D. Vigo, Ricent advances on twodimensional bin packing problems, Discrete Applied Mathematics 123, pp.373-390, 2002.
DOI
ScienceOn
|
15 |
P. C. Gilmore and R. E. Gomory, Multistage cutting problems of two and more dimensions, Operations Research, Vol.13, No.1, pp.94-120, 1965
DOI
ScienceOn
|
16 |
S. Martello and D. Vigo, Exact solution of the two dimensional finite bin packing problem, Management Science, Vol.44, pp. 388-399, 1998.
DOI
ScienceOn
|
17 |
A. Lodi, S. Martello and D. Vigo, Approximation algorithms for the oriented two-dimensional bin packing problem, European Journal of Operational Research, Vol.112, 158-166, 1999.
DOI
ScienceOn
|
18 |
A. Lodi, S. Martello and D. Vigo, Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems, INFORMS Journal of Computing, Vol.11, No.4, pp. 345-357, 1999.
DOI
ScienceOn
|
19 |
S. Martello, M. Monaci and D. Vigo, An exact approach to the strip packing problem, Informs Journal on Computing, Vol.15, 310-319, 2003.
DOI
ScienceOn
|
20 |
S. Martello and P. Toth, Lower bounds and reduction procedures for the bin packing problem, Discrete Applied Mathematics, Vol.28, pp.59-70, 1990.
DOI
ScienceOn
|
21 |
A. Lodi, S. Martello and M. Monaci, Two-dimensional packing problems: a survey, European Journal of Operational Research, Vol.141, pp.241-252, 2002.
DOI
ScienceOn
|