1G Y-G, Kang M-K. A new upper bound for unconstrained two-dimensional cutting and packing [J]. Journal of the Operational Research Society, 2002, 53(5): 587-591.
2Andonov R, Poirrez V, Rajopadhye S. Unbounded knapsack problem: Dynamic programming revisited [J], European Journal of Operational Research, 2000, 123(2): 394-407.
3Valerio C J M. LP models for bin packing and cutting stock problems [J]. European Journal of Operational Research, 2002,141(2): 253-273.
