Bibliography

1

M. Arenales, R. Morabito e H. Yanasse (eds.) (1999). Special issue: Cutting and packing problems. Pesquisa Operacional 19, pp. 109-284.

2

R. Balasubramanian (1992). The pallet loading problem: A survey. International Journal of Production Economics 28, pp. 217-225.

3

S. Bhattacharya, R. Roy e S. Bhattacharya (1998). An exact depth-first algorithm for the pallet loading problem. European Journal of Operational Research 110, pp. 610-625.

4

E. G. Birgin, J. M. Martínez (2001). A box constrained optimization algorithm with negative curvature directions and spectral projected gradients. Computing [Suppl] 15, pp. 49-60.

5

E. G. Birgin, J. M. Martínez (2002). Large-scale active-set box-constrained optimization method with spectral projected gradients. Computational Optimization and Applications 23, pp. 101-125.

6

E.G. Birgin, J.M. Martínez, W.F.Mascarenhas e D.P. Ronconi (2003). Method of Sentinels for Packing Objects on Arbitrary Regions.

7

E.G. Birgin, J.M. Martínez e D.P. Ronconi (2003). Optimizing the Packing of Cylinders into a Rectangular Container: A Nonlinear Approach. Submetido a European Journal of Operational Research.

8

E. G. Birgin, J. M. Martínez, M. Raydan (2000). Nonmonotone spectral projected gradient methods on convex sets. SIAM Journal on Optimization 10, pp. 1196-1211.

9

E. G. Birgin, J. M. Martínez, M. Raydan (2001). SPG: Software for convex-constrained optimization. ACM Transactions on Mathematical Software 27, pp. 340-349.

10

E. Bischoff e W. Dowsland (1982). An application of the micro to product design and distribution. Journal of the Operational Research 33, pp. 271-280.

11

E. Bischoff e G. Waescher (eds.) (1995). Special issue on cutting and packing. European Journal of Operational Research 84, pp. 503-712.

12

T. Cormen, C. Leiserson e R. Rivest (1990). Introduction to algorithms. The MIT Press, McGraw-Hill Book Company.

13

J. E. Dennis Jr., R. B. Schnabel (1983). Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewoods Cliffs.

14

K. Dowsland (1987). An exact algorithm for the pallet loading problem. European Journal of Operational Research 31, pp. 78-84.

15

K. Dowsland e W. Dowsland (1992). Packing problems. European Journal of Operational Research 56, pp. 2-14.

16

H. Dyckhoff (1990). A typology of cutting and packing problems. European Journal of Operational Research 44, pp. 145-159.

17

H. Dyckhoff e U. Finke (1992). Cutting and packing in production and distribution: Typology and bibliography. Springler-Verlag Co: Heildelberg.

18

H. Dyckhoff, G. Scheithauer e J. Terno (1997). Cutting and packing. In M. Amico, F. Maffioli, F., S. Martello (ed). Annotated bibliographies in combinatorial optimisation. John Wiley & Sons: New York, pp. 393-414.

19

Y. G e M. Kang (2001). A fast algorithm for two-dimensional pallet loading problems of large size. European Journal of Operational Research 134, pp. 193-200.

20

A. Herbert e K. Dowsland (1996). A family of genetic algorithms for the pallet loading problem. Annals of Operations Research 63, pp. 415-436.

21

M. Hifi (ed.) (2002). Special issue on cutting and packing. Studia Informatica Universalis 2, pp. 1-161.

22

T. Hodgson (1982). A combined approach to the pallet loading problem. IIE Transactions 14, pp. 176-182.

23

A. Letchford e A. Amaral (2001). Analysis of upper bounds for the pallet loading problem. European Journal of Operational Research 132, pp. 582-593.

24

L. Lins, S. Lins e S. Melo (2002). PHORMA: Symmetry robust memory management of multidimensional arrays. Submetido a Discrete Applied Mathematics.

25

L. Lins, S. Lins e R. Morabito (2002). An n-tet graph approach for nonguillotine packings of n-dimensional boxes into an n-container. European Journal of Operational Research 141, pp. 421-439.

26

L. Lins, S. Lins e R. Morabito (2003), An L-Approach for Packing (l,w)-Rectangles into Rectangular and L-Shaped Pieces. Journal of the Operational Research Society.

27

D. G. Luenberger (1984). Linear and Nonlinear Programming. Addison-Wesley, California, London, Amsterdam, Ontario, Sydney.

28

S. Martello (ed.) (1994), Special issue: Knapsack, packing and cutting, Part II: Multidimensional knapsack and cutting stock problems. INFOR, 32.

29

R. Morabito e M. Arenales (1995). An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems. European Journal of Operational Research 84, pp. 599-617.

30

R. Morabito e R. Farago (2002). A tight Lagrangean relaxation bound for the manufacturer's pallet loading problem. Studia Informatica Universalis 2, pp. 57-76.

31

R. Morabito e S. Morales (1998). A simple and effective recursive procedure for the manufacturer's pallet loading problem. Journal of the Operational Research Society 49, pp. 819-828.

32

R. Morabito e S. Morales (1999). Errata: A simple and effective recursive procedure for the manufacturers pallet loading problem . Journal of the Operational Research Society 50, pp. 876.

33

J. Nelissen (1994). Solving the pallet loading problem more effciently. Working Paper, Graduiertenkolleg Informatik und Technik, Aachen.

34

J. Nelissen (1995). How to use structural constraints to compute an upper bound for the pallet loading problem. European Journal of Operational Research 84, pp. 662-680.

35

G.L. Nemhauser e L.A. Wosley (1988). Integer and Combinatorial Optimization. Wiley.

36

G. Scheithauer e G. Sommerweiss (1998). 4-block heuristic for the rectangle packing problem. European Journal of Operational Research 108, pp. 509-526.

37

G. Scheithauer e J. Terno (1996). The G4-heuristic for the pallet loading problem. Journal of the Operational Research Society 47, pp. 511-522.

38

A. Smith e P. De Cani (1980). An algorithm to optimize the layout of boxes in pallets. Journal of the Operational Research Society 31, pp. 573-578.

39

L. Schrage (1979). A more portable Fortran random number generator. ACM Transactions on Mathematical Software 5, pp. 132-138.

40

H. Steudel (1979). Generating pallet loading patterns: A special case of the two-dimensional cutting stock problem. Management Science 10, pp. 997-1004.

41

P. Sweeney e E. Paternoster (1992). Cutting and packing problems: A categorized, application-oriented research bibliography. Journal of the Operational Research Society 43, pp. 691-706.

42

R. Tsai, E. Malstrom e W. Kuo (1993). Three dimensional palletization of mixed box sizes. IEE Transactions 25, pp. 64-75.

43

P. Wang e G. Waescher (eds.) (2002). Special issue on cutting and packing. European Journal of Operational Research 141, pp. 239-469.