Strip generation algorithms for constrained two-dimensional two-staged cutting problems : part II
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.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
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.
|Date of creation:||Nov 2004|
|Date of revision:|
|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
Web page: http://mse.univ-paris1.fr/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:mse:wpsorb:b04095. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lucie Label)
If references are entirely missing, you can add them using this form.