- Tytuł:
- A branch&bound algorithm for solving one-dimensional cutting stock problems exactly
- Autorzy:
-
Scheithauer, Guntram
Terno, Johannes - Powiązania:
- https://bibliotekanauki.pl/articles/1340291.pdf
- Data publikacji:
- 1995
- Wydawca:
- Polska Akademia Nauk. Instytut Matematyczny PAN
- Tematy:
-
rounding
cutting stock problem
branch&bound
integer optimization - Opis:
- Many numerical computations reported in the literature show only a small difference between the optimal value of the one-dimensional cutting stock problem (1CSP) and that of the corresponding linear programming relaxation. Moreover, theoretical investigations have proven that this difference is smaller than 2 for a wide range of subproblems of the general 1CSP.
- Źródło:
-
Applicationes Mathematicae; 1995-1996, 23, 2; 151-167
1233-7234 - Pojawia się w:
- Applicationes Mathematicae
- Dostawca treści:
- Biblioteka Nauki
Artykuł