COnstrained Two-Dimensional Cutting Stock Problems a Best-First Branch-and-Bound Exact Algorithm

V.-D. Cung, M. Hifi and B. Le Cun

Papiers d'Economie Mathématique et Applications from Université Panthéon-Sorbonne (Paris 1)

Abstract: In this paper we develop a new version of the algortihm proposed in [17] for solving exactly some variants of (un)weighted constrained two-dimensional cutting stock problems. We introduce one-dimensional bounded knapsacks in order to obtain an improved initial lower bound for limitating initially the space search, an improved upper bound at each internal node, a symmetric-strategy for neglecting some unnecessary duplicate patterns, a new data structure of the set representing the best subproblems and we use some characteristics of the BOB-library.

Keywords: OPTIMIZATION; DYNAMIC ANALYSIS (search for similar items in EconPapers)
JEL-codes: C61 (search for similar items in EconPapers)
Pages: 27 pages
Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:fth:pariem:97.88

Access Statistics for this paper

More papers in Papiers d'Economie Mathématique et Applications from Université Panthéon-Sorbonne (Paris 1) France; Universite de Paris I - Pantheon- Sorbonne, 12 Place de Pantheon-75005 Paris, France. Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().