| Texto completo | |
| Autor(es): |
Litvinchev, Igor
;
Rangel, Socorro
;
Saucedo, Jania
Número total de Autores: 3
|
| Tipo de documento: | Artigo Científico |
| Fonte: | JOURNAL OF COMBINATORIAL OPTIMIZATION; v. 19, n. 3, p. 17-pg., 2010-04-01. |
| Resumo | |
A simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem into two subproblems. Second, it can be considered as a search for a tighter estimation of the penalty term arising in the Lagrangian problem. The new bounds are illustrated by a small example and studied numerically for a class of the generalized assignment problems. (AU) | |
| Processo FAPESP: | 07/08678-5 - Special cutting patterns and reduction of saw machine set ups in the cutting stock problem. |
| Beneficiário: | Maria Do Socorro Nogueira Rangel |
| Modalidade de apoio: | Auxílio à Pesquisa - Reunião - Exterior |
| Processo FAPESP: | 06/03496-3 - Teoria e prática dos problemas de corte e empacotamento |
| Beneficiário: | Marcos Nereu Arenales |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |