Please use this identifier to cite or link to this item:
http://hdl.handle.net/10400.5/96147| Title: | Linear and Lagrangean Penalties for ILP. An Application to a Covering Problem |
| Author: | Pato, Margarida Vaz |
| Keywords: | Integer Linear Programming Covering Problems Lagrangean Relaxation Penalties |
| Issue Date: | 1992 |
| Publisher: | APDIO |
| Citation: | Pato, Margarida Vaz .(1992). “Linear and Lagrangean Penalties” for ILP. An Application to a Covering Problem”. Investigação Operacional, Volume 12: no.1: pp. 43-50. 1992 |
| Abstract: | 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 . |
| URI: | http://hdl.handle.net/10400.5/96147 |
| ISSN: | 0874-5161 |
| Appears in Collections: | DM - Artigos em Revistas Nacionais / Articles in Portuguese Journals |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Linear and Lagrangean Penalties for ILP. An Application to a Covering Problem_IO_ vol.12_pp. 43-50_1992.pdf | 303,86 kB | Adobe PDF | View/Open |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
