Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems

M. Hifi

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

Abstract: In this paper we propose two exact algorithms for solving both two-staged and three-staged unconstrained (un) weighted cutting problems. The two-staged problem is solved by applying a dynamic programming procedure originally developed by Gilmore and Gomory [10]. The three-staged problem is solved by using a top-down approach combined with a dynamic programming procedure. The performance of the exact algorithms are evaluated on some problem instances of the literature and other hard randomly-generated problem instances (a total of 53 problem instances). A parallel implementation is an important feature of the algorithm used for solving the three-staged version.

Keywords: MATHEMATICS; ECONOMIC MODELS (search for similar items in EconPapers)
JEL-codes: C61 (search for similar items in EconPapers)
Pages: 24 pages
Date: 1999
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:1999-26

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 ().