Relaxation techniques applied to some loading problems

References

• Beasley , J.E. Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure . Operational Research , 33 ( 1 )
   Web of Science ®Google Scholar
• Beasley , J.E. and Beasley , J.E. 1985 . Bounds for Two-Dimensional Cutting . Journal of the Operational Research Society , 36 ( 1 ) : 71 – 74 .
   Web of Science ®Google Scholar
• Brown , A.R. 1971 . Optimum packing and depletion , New York : American Elsevier .
   Google Scholar
• Chalmet , L. and Gelders , L. 1977 . “ Lagrangean Relaxations for a Generalized Assignment-type Problem ” . In Advances in Operations Research , Edited by: Roubens , M. Amsterdam : North-Holland .
   Google Scholar
• Dudzinski , K. and Walukiewicz , S. 1987 . Exact Methods for the Knapsack Problem and its Generalizations . European Journal of Operational Research , 28 : 3 – 21 .
   Web of Science ®Google Scholar
• Eilon , S. and Christofides , N. 1971 . The Loading Problem . Management Science , 17 ( 2 ) : 259 – 268 .
   Google Scholar
• Eilon , S. and Christofides , N. 1972 . On the Loading Problem—A Rejoinder . Management Science , 18 ( 2 ) : 432 – 433 .
   Google Scholar
• Eisemann , K. 1957 . The Trim Problem . Management Science , 3 ( 2 ) : 279 – 284 .
   Google Scholar
• Erlekotter , D. 1978 . A Dual-Based Procedure for Uncapacitated Facility Location . Operations Research , 26 ( 6 )
   Web of Science ®Google Scholar
• Geoffrion , A.M. “ Lagrangean Relaxations for Integer Programming ” . In Mathematical Programming Study 2: Approaches to Integer Programmi Edited by: Balinski , M.L. 82 – 114 .
   Google Scholar
• Gilmore , P.C. and Gomory , R.E. 1961 . A Linear Programming Approach to the Cutting Stock Problem . Operations Research , 9 ( 6 ) : 849 – 859 .
   Web of Science ®Google Scholar
• Gilmore , P.C. and Gomory , R.E. 1963 . A Linear Programming Approach to the Cutting Stock Problem, Part II . Operations Research , 11 ( 6 ) : 863 – 888 .
   Web of Science ®Google Scholar
• Gilmore , P.C. and Gomory , R.E. 1965 . Multistage Cutting Stock Problems of Two and More Dimensions . Operations Research , 13 ( 6 ) : 94 – 120 .
   Google Scholar
• Haessler , R.W. 1975 . Controlling Pattern Changes in One-Dimensional Cutting Stock Problems . Operations Research , 23 ( 6 ) : 483 – 493 .
   Google Scholar
• Hahn , S. 1968 . On the Optimal Cutting of Defective Glass Sheets . Operations Research , 16 ( 6 ) : 1100 – 1114 .
   Web of Science ®Google Scholar
• Held , M. , Wolfe , P. and Crowder , H. 1974 . Validation of Subgradient Optimization . Mathematical Programming , 6 ( 6 ) : 62 – 68 .
   Google Scholar
• Hung , M.S. and Brown , A.R. 1978 . An Algorithm for a Class of Loading Problems . Naval Research Logistics Quarterly , 25 ( 6 ) : 289 – 297 .
   Google Scholar
• Johnson , D.S. 1973 . Near-Optimal Bin Packing Algorithms, Doctoral thesis , M.1.T .
   Google Scholar
• Johnson , D.S. 1974 . Fast Algorithms for Bin Packing . Journol of computer and system science , 8 : 272 – 314 .
   Web of Science ®Google Scholar
• Jörnsten , K. and Värbrand , P. 1990 . Two New Algorithms for the Generalized Assignment Problem, Asia-Pacific . Journal of Operationai Research , 7 ( 2 ) : 172 – 189 .
   Google Scholar
• Lewis , R.T. and Parker , R.G. 1982 . On a Generalized Bin-Packing Problem . Naval Research Logistics Quarterly , 29 ( 2 ) : 119 – 145 .
   Google Scholar
• Pirkul , H. 1987 . Efficient Algorithms for the Capacitated Concentrator Location Problem . Computers and Operations Research , 14 ( 3 ) : 197 – 208 .
   Web of Science ®Google Scholar
• Ross , G.T. and Soland , R.M. 1975 . A Branch and Bound Algorithm for the Generalized Assignment Problem . Mathematical Programming , 8 ( 3 ) : 91 – 103 .
   Google Scholar
• Steudel , H.J. 1979 . Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem . Management Science , 25 ( 3 ) : 997 – 1004 .
   Google Scholar
• Värbrand , P. 1988 . Generalized Assignment Type Problems: Models and Solution Procedures, Linköping Studies in Science and Technology , Linkoping University . Disertation 193
   Google Scholar
• Wang , P.Y. 1983 . Two Algorithms for Constrained Two-dimensional Cutting Stock Problems . Operations Research , 31 ( 3 )
   Web of Science ®Google Scholar
• Yao , A.C. 1980 . New Algorithms for Bin Packing . Journal of the Association for Computing Machinery , 27 ( 3 ) : 207 – 227 .
   Google Scholar