Strip generation algorithms for constrained two-dimensional two-staged cutting problems: part II

Mhand Hifi () and Rym M'Hallah
Additional contact information
Mhand Hifi: LaRIA et CERMSEM
Rym M'Hallah: Kuwait University

Cahiers de la Maison des Sciences Economiques from Université Panthéon-Sorbonne (Paris 1)

Abstract: We study the two-staged fixed orientation constrained two-dimensional two-staged cutting stock problem. We solve the problem using several approximate algorithms, that are mainly based upon a strip generation procedure (HESGA) already developed in ([13)]. We evaluate the performance of these algorithms on instances extracted from the literature. The obtained results are compared to the results reached by the Cplex solver

Keywords: Approximate algorithms; cutting problems; dynamic programming; single constrained knapsack problems; optimization (search for similar items in EconPapers)
JEL-codes: C44 C61 C63 (search for similar items in EconPapers)
Pages: 18 pages
Date: 2004-11
New Economics Papers: this item is included in nep-cmp
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:mse:wpsorb:b04095

Access Statistics for this paper

More papers in Cahiers de la Maison des Sciences Economiques from Université Panthéon-Sorbonne (Paris 1) Contact information at EDIRC.
Bibliographic data for series maintained by Lucie Label ().