Publicação
Linear and Lagrangean Penalties for ILP. An Application to a Covering Problem
| Resumo: | Lagrangean and linear penalties can be used for variable bounding in ILP. Such penalties, embedded in a branch-and-bound algorithm, yield remarkable reductions in the search procedure effort for large scale problems. In this paper, four different ways of exploring this idea for a covering problem with integer variables are presented. Computing results taken from test problems have revealed the efficiency of the technique in reducing the amplitude of variable intervals, and even in fixing them at feasible values . |
|---|---|
| Autores principais: | Pato, Margarida Vaz |
| Assunto: | Integer Linear Programming Covering Problems Lagrangean Relaxation Penalties |
| Ano: | 1992 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade de Lisboa |
| Idioma: | inglês |
| Origem: | Repositório da Universidade de Lisboa |
| Resumo: | Lagrangean and linear penalties can be used for variable bounding in ILP. Such penalties, embedded in a branch-and-bound algorithm, yield remarkable reductions in the search procedure effort for large scale problems. In this paper, four different ways of exploring this idea for a covering problem with integer variables are presented. Computing results taken from test problems have revealed the efficiency of the technique in reducing the amplitude of variable intervals, and even in fixing them at feasible values . |
|---|