This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

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

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Mhand Hifi () (LaRIA et CERMSEM)
Rym M'Hallah (Kuwait University)
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.

Download Info
To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Publisher Info
Paper provided by Université Panthéon-Sorbonne (Paris 1) in its series Cahiers de la Maison des Sciences Economiques with number b04095.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 18 pages
Date of creation: Nov 2004
Date of revision:
Handle: RePEc:mse:wpsorb:b04095

Contact details of provider:
Postal: 106 - 112 boulevard de l'H�pital, 75647 Paris cedex 13
Phone: 01 44 07 81 00
Fax: 01 44 07 81 09
Email:
Web page: http://mse.univ-paris1.fr/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Jacqueline Pradel).

Related research
Keywords: Approximate algorithms; cutting problems; dynamic programming; single constrained knapsack problems; optimization.;

Find related papers by JEL classification:
C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Statistical Decision Theory; Operations Research
C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis
C63 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Computational Techniques

This paper has been announced in the following NEP Reports:

Statistics
Access and download statistics

Did you know? All bibliographic data on IDEAS has been put in the public domain by the publishers.

This page was last updated on 2009-12-12.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.