Packing problems

European Journal of Operational Research

Volumn 56, Issue 1, 1992, Pages 2-14

  Dowsland, Kathryn A ^a   Dowsland, William B ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

combinatorial analysis; distribution; dynamic programming; heuristics; mathematical programming; Packing; storage

Indexed keywords

EID: 44049122342     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(92)90288-K     Document Type: Article

References (115)

1. A two-stage solution of the cutting-stock problem
2. A solution of the rectangular cutting-stock
3. Nesting two-dimensional shapes in rectangular modules
4. A heuristic solution of the rectangular cutting stock problem
5. Optimal allocation of two-dimensional irregular shapes using heuristic search methods
6. An approach to the two dimensional, irregular cutting stock problem
7. Orthogonal packings in two dimensions
8. A tight asymptotic bound for next-fit-decreasing bin-packing
9. Approximation algorithms for maximizing the number of squares packed into a rectangle
10. Shelf algorithms for two-dimensional packing problems
11. Packing the maximum number of m × n tiles in a large p × q rectangle
12. Exact solution of a simple cutting problem
13. Expected performance of the shelf heuristic for 2P packing
14. An exact two-dimensional non-guillotine cutting tree search procedure
15. Bounds for two dimensional cutting
16. Algorithms for unconstrained two-dimensional guillotine cutting
17. Packing rectangular pieces - A heuristic approach
18. Network flows and non-guillotine cutting patterns
19. Stability aspects of packing problems
20. An application of the micro to product design and distribution
21. A comparative evaluation of heuristics for container loading
22. Practical experiences with semiautomatic, and automatic partnesting methods
23. The dissection of rectangles into squares
24. An improved BL lower bound
25. Practical considerations of the pallet loading problem
26. Optimal cutting of two-dimensional rectangular plates
27. An algorithm for two-dimensional cutting problems
28. Loading problems
29. On packing two-dimensional bins
30. Improving utilisation of air force cargo aircraft
31. Bin packing: maximizing the number of pieces packed
32. Approximation algorithms for bin packing - an updated survey
33. Dynamic, first fit packings in two or more dimensions
34. Asymptotic methods in the probabilistic analysis of sequencing and packing heuristics
35. Algorithms for packing squares: a probabilistic analysis
36. Average-case analysis of cutting and packing in two dimensions
37. Mrs Perkins's quilt
38. Knowledge-based systems for cutting stock problems
39. An improved algorithm for the non-guillotine-constrained cutting-stock problem
40. A note on the two-dimensional rectangular cutting-stock problem
41. Packing Problems in Theory and Practice
42. Nonorthogonal twodimensional cutting patterns
43. Efficient nesting on congruent convex figures
44. The three-dimensional pallet chart: An analysis of the factors affecting the set of feasible layouts for a class two-dimensional packing problems
45. Determining an upper bound for a class of rectangular packing problems
46. A graph-theoretic approach to the pallet loading problem
47. An exact algorithm for the pallet loading problem
48. A combined database and algorithmic approach to the pallet loading problem
49. Efficient automated pallet loading
50. The computer as an aid to physical distribution management
51. Two and three dimensional packing problems and solution methods
52. A typology of cutting and packing problems
53. Trim loss and related problems
54. Optimising the shearing of steel bars
55. The loading problem
56. Optimal packing and covering in the plane are NP-complete
57. Determining the minimum-area encasing rectangle for an arbitratry closed curve
58. Variable sized bin packing
59. A computer-based heuristic for packing pooled shipment containers
60. A heuristic for packing boxes into a container
61. A linear programming approach to the cutting-stock problem (Part 1)
62. A linear programming approach to the cutting-stock problem (Part 2)
63. Multistage cutting stock problems of two and more dimensions
64. The theory and computation of knapsack functions
65. Performance bounds for orthogonal oriented two-dimensional packing algorithms
66. Approaches to the cutting stock problem
67. Additional considerations on market layout problem via graph theory
68. Market layout problem via graph theory: an attempt for optimal layout of irregular patterns
69. Circular graph of market layout
70. A note on computational modifications to the GilmoreGomory cutting stock algorithm
71. Load planning for shipments of low density products
72. On the optimal cutting of defective sheets
73. A multistage solution of the templatelayout problem
74. A heuristic approach to the three-dimensional cargo-loading problem
75. Recursive computational procedure for two-dimensional stock cutting
76. The trim-loss and assortment problems: a survey
77. A combined approach to the pallet loading problem
78. A note on a combined approach to the pallet loading problem
79. Two-dimensional packing: Expected performance of simple level algorithms
80. The pansy, an advanced interactive parts nesting system
81. Ein Planungssystem zur Optimierung der Palettenbeladung mit kongruenten rechteckigen Versandgebinden
82. Performance testing of rectangular parts-nesting heuristics
83. Mathematical methods of organising and planning production
84. Simulated annealing: use of a new tool in bin packing
85. A new algorithm for container loading
86. Solution methods for two and three dimensional packing problems
87. Putting objects into boxes
88. Operational research and material handling
89. A search model for evaluating combinatorially explosive problems
90. Stock slitting
91. An improved version of Wang's algorithm for two-dimensional cutting problems
92. The trim problem: an application of linear programming to the manufacture of newsprint paper
93. Computerised pallet stacking
94. Container dimensions for optimal utilization of storage and transportation space
95. Robotic implementation of pallet loading patterns
96. Three dimensional stacking of containers
97. Optimal batch execution on a multiprocessing computer - a 2D packing problem
98. An algorithm to optimize the layout of boxes in pallets
99. Nesting is more than a layout problem
100. Generating pallet loading patterns: a special case of the two-dimensional cutting stock problem
101. Generating pallet loading patterns with considerations of item stacking on end and side surfaces
102. How to determine existence of acceptable pallet patterns
103. Mathematical methods for geometry design
104. Cutting and packing problems: A categorized, application-oriented research bibliography
105. Un problema di caricamento di containers
106. A two-dimensional palletizing procedure for warehouse loading operations
107. A computational improvement to Wang's two-dimensional cutting stock algorithm
108. Two algorithms for constrained two-dimensional cutting stock problems
109. There may be a better pack for you
110. A systems approach to packaging design
111. Pallet loading configurations for optimum storage and shipping