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

Belov, G; Scheithauer, G.

doi:10.1016/S0377-2217(02)00125-X

Record: found
Abstract: not found
Article: not found

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

Author(s): G. Belov , G. Scheithauer

Publication date Created: September 2002

Publication date (Print): September 2002

Journal: European Journal of Operational Research

Publisher: Elsevier BV

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: European Journal of Operational Research

Abbreviated Title: European Journal of Operational Research

Publisher: Elsevier BV

ISSN (Print): 03772217

Publication date Created: September 2002

Publication date (Print): September 2002

Volume: 141

Issue: 2

Pages: 274-294

Article

DOI: 10.1016/S0377-2217(02)00125-X

SO-VID: a97d0ae8-eb42-463d-a116-8eceea9d0927

License:

https://www.elsevier.com/tdm/userlicense/1.0/

History

Data availability:

Comments

Comment on this article

scite_

Cited by 7

See all cited by

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

Read this article at

Related collections

General Collective Intelligence Platforms and Hive Minds

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 1,452

Cited by 7