Geodesic
The grouping method for the linear relaxation of 1d cutting stock problem
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 3, pp. 47-62

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider the problem of large-dimension linear cutting. This problem could be interpreted as a problem of linear integer programming. Using the proposed grouping method we can get the initial solution for the problem of continuous relaxation. This solution is close to the optimum, which often reducing the time to find optimal solutions. Bibl. 15.
Keywords: linear relaxation, simplex-method, 1d cutting stock problem. 
@article{DA_2009_16_3_a2,
     author = {V. M. Kartak},
     title = {The grouping method for the linear relaxation of 1d cutting stock problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {47--62},
     publisher = {mathdoc},
     volume = {16},
     number = {3},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_3_a2/}
}
TY  - JOUR
AU  - V. M. Kartak
TI  - The grouping method for the linear relaxation of 1d cutting stock problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 47
EP  - 62
VL  - 16
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_3_a2/
LA  - ru
ID  - DA_2009_16_3_a2
ER  - 
%0 Journal Article
%A V. M. Kartak
%T The grouping method for the linear relaxation of 1d cutting stock problem
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 47-62
%V 16
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_3_a2/
%G ru
%F DA_2009_16_3_a2
V. M. Kartak. The grouping method for the linear relaxation of 1d cutting stock problem. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 3, pp. 47-62. http://geodesic.mathdoc.fr/item/DA_2009_16_3_a2/