Adaptive beam search solution procedures for constrained circular cutting problems.
Year of publication: |
2007-11
|
---|---|
Authors: | Akeb, Hakim ; Hifi, Mhand |
Institutions: | Centre d'Économie de la Sorbonne, Université Paris 1 (Panthéon-Sorbonne) |
Subject: | Approximate algorithms | beam search | best local position | cutting stock | Hill-Climbing |
Extent: | application/pdf |
---|---|
Series: | Documents de travail du Centre d'Economie de la Sorbonne. - ISSN 1955-611X. |
Type of publication: | Book / Working Paper |
Notes: | 21 pages |
Classification: | C44 - Statistical Decision Theory; Operations Research ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; C63 - Computational Techniques |
Source: |
-
Algorithms for the circular open dimension problem.
Akeb, Hakim, (2007)
-
Strip generation algorithms for constrained two-dimensional two-staged cutting problems : part II.
Hifi, Mhand, (2004)
-
Beam search-based algorithms for the circular packing problem.
Akeb, Hakim, (2007)
- More ...
-
Beam search-based algorithms for the circular packing problem.
Akeb, Hakim, (2007)
-
Algorithms for the circular open dimension problem.
Akeb, Hakim, (2007)
-
Sensitivity analysis of the knapsack sharing problem : perturbation of the profit.
Belgacem, Tarik, (2007)
- More ...