REFERENCES
- Andonov , R. , Poirriez , V. and Rajopadhye , S. 2000 . Unbounded knapsack problem: dynamic programming revisited . European Journal of Operational Research , 123 : 394 – 407 . [CSA]
- Carvalho , J. M.V. 2002 . LP models for bin packing and cutting stock problems . European Journal of Operational Research , 141 : 253 – 273 . [CSA] [CROSSREF]
- Cui , Y. 2005 . Generating optimal T-shape cutting patterns for circular blanks . Computers & Operations Research , 32 ( 1 ) : 143 – 152 . [CSA] [CROSSREF]
- Gilmore , P. C. and Gomory , R. E. 1961 . A linear programming approach to the cutting stock problem . Operations Research , 9 ( 6 ) : 849 – 859 . [CSA]
- 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 . [CSA]
- Gilmore , P. C. and Gomory , R. E. 1965 . Multistage cutting stock problems of two or more dimensions . Operations Research , 13 ( 1 ) : 94 – 120 . [CSA]
- Joshi , S. and Sudit , M. 1994 . Procedures for solving single-pass strip layout problems . IIE Transactions , 26 : 27 – 37 . [CSA]
- Locatelli , M. and Raber , U. 2002 . Packing equal circles in a square: a deterministic global optimization approach . Discrete Applied Mathematics , 122 : 139 – 166 . [CSA] [CROSSREF]
- Nye , T. J. 2001 . Optimal nesting of irregular convex blanks in strips via an exact algorithm . International Journal of Machine Tools & Manufacture , 41 : 991 – 1002 . [CSA] [CROSSREF]
- Stoyan , Y. G. and Yaskov , G. N. 1998 . Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints . International Transactions on Operational Research , 5 : 45 – 57 . [CSA] [CROSSREF]