An efficient approach for large-scale two-dimensional guillotine cutting stock problems.

Deals with a study that proposed an efficient method for solving constrained and unconstrained two-dimensional cutting (TDC) stock problems. Background information on TDC problem; Four versions of the TDC problem that can be distinguished; Information on the General Best Strips Cutting algorithm (GBSC); Main steps of GBSC algorithms; Discussion and conclusion.