A simulated annealing heuristic for the one-dimensional cutting stock problem

Author： Chuen-Lung S.C. Hart S.M. Wai M.T.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.93, Iss.3, 1996-09, pp. : 522-535

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Random search in the one-dimensional cutting stock problem

By Vahrenkamp R.

European Journal of Operational Research, Vol. 95, Iss. 1, 1996-11 ,pp. : 191-200

Elsevier

Access to resources Recommend Favorite

An application of simulated annealing to the cutting stock problem

By Faina L.

European Journal of Operational Research, Vol. 114, Iss. 3, 1999-05 ,pp. : 542-556

Elsevier

Access to resources Recommend Favorite

One-dimensional cutting stock problem to minimize the number of different patterns

By Umetani S. Yagiura M. Ibaraki T.

European Journal of Operational Research, Vol. 146, Iss. 2, 2003-04 ,pp. : 388-402

Elsevier

Access to resources Recommend Favorite

A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths

By Belov G. Scheithauer G.

European Journal of Operational Research, Vol. 141, Iss. 2, 2002-09 ,pp. : 274-294

Elsevier

Access to resources Recommend Favorite

A sequential heuristic procedure for one-dimensional cutting

By Gradisar M. Kljajic M. Resinovic G. Jesenko J.

European Journal of Operational Research, Vol. 114, Iss. 3, 1999-05 ,pp. : 557-568

Elsevier

Access to resources Recommend Favorite