Geodesic
A branch algorithm for solving one-dimensional cutting stock problems exactly
Applicationes Mathematicae, Tome 23 (1996) no. 2, pp. 151-167.

Voir la notice de l'article provenant de la source Institute of Mathematics Polish Academy of Sciences

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.
DOI : 10.4064/am-23-2-151-167
Keywords: rounding, cutting stock problem, branch&bound, integer optimization

Guntram Scheithauer 1 ; Johannes Terno 1

1 
@article{10_4064_am_23_2_151_167,
     author = {Guntram Scheithauer and Johannes Terno},
     title = {A branch&bound algorithm for solving one-dimensional cutting stock problems exactly},
     journal = {Applicationes Mathematicae},
     pages = {151--167},
     publisher = {mathdoc},
     volume = {23},
     number = {2},
     year = {1996},
     doi = {10.4064/am-23-2-151-167},
     zbl = {0831.90091},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.4064/am-23-2-151-167/}
}
TY  - JOUR
AU  - Guntram Scheithauer
AU  - Johannes Terno
TI  - A branch&bound algorithm for solving one-dimensional cutting stock problems exactly
JO  - Applicationes Mathematicae
PY  - 1996
SP  - 151
EP  - 167
VL  - 23
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.4064/am-23-2-151-167/
DO  - 10.4064/am-23-2-151-167
LA  - en
ID  - 10_4064_am_23_2_151_167
ER  - 
%0 Journal Article
%A Guntram Scheithauer
%A Johannes Terno
%T A branch&bound algorithm for solving one-dimensional cutting stock problems exactly
%J Applicationes Mathematicae
%D 1996
%P 151-167
%V 23
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.4064/am-23-2-151-167/
%R 10.4064/am-23-2-151-167
%G en
%F 10_4064_am_23_2_151_167
Guntram Scheithauer; Johannes Terno. A branch&bound algorithm for solving one-dimensional cutting stock problems exactly. Applicationes Mathematicae, Tome 23 (1996) no. 2, pp. 151-167. doi : 10.4064/am-23-2-151-167. http://geodesic.mathdoc.fr/articles/10.4064/am-23-2-151-167/

Cité par Sources :