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

Author： Umetani S. Yagiura M. Ibaraki T.

Publisher： Elsevier

ISSN： 0377-2217

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

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

Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths

By Holthaus O.

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

Elsevier

Access to resources Recommend Favorite

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

By Chuen-Lung S.C. Hart S.M. Wai M.T.

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

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

Parallelized sequential value correction procedure for the one-dimensional cutting stock problem with multiple stock lengths

By Cui Yi-Ping Tang Tian-Bing

Engineering Optimization, Vol. 46, Iss. 10, 2014-10 ,pp. : 1352-1368

Taylor & Francis Ltd

Access to resources Recommend Favorite