|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ИНХС РАН |
||
Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)статья
- Авторы: Mukhacheva E.A., Belov G.N., Kartack V.M., Mukhacheva A.S.
- Журнал: Pesquisa Operacional
- Том: 20
- Номер: 2
- Год издания: 2000
- Издательство: Sociedade Brasileira de Pesquisa Operacional
- Местоположение издательства: Brazil
- Первая страница: 153
- Последняя страница: 168
- DOI: 10.1590/s0101-74382000000200002
- Аннотация: Two algorithms for the one-dimensional cutting problem, namely, a modified branch-and-bound method (exact method) and a heuristic sequential value correction method are suggested. In order to obtain a reliable assessment of the efficiency of the algorithms, hard instances of the problem were considered and from the computational experiment it seems that the efficiency of the heuristic method appears to be superior to that of the exact one, taking into account the computing time of the latter. A detailed description of the two methods is given along with suggestions for their improvements.
- Добавил в систему: Картак Вадим Михайлович