Linear and Lagrangean Penalties for ILP. An Application to a Covering Problem

Publication

dc.contributor.author	Pato, Margarida Vaz
dc.date.accessioned	2024-12-09T16:52:22Z
dc.date.available	2024-12-09T16:52:22Z
dc.date.issued	1992
dc.description.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 .	pt_PT
dc.description.version	info:eu-repo/semantics/publishedVersion	pt_PT
dc.identifier.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	pt_PT
dc.identifier.issn	0874-5161
dc.identifier.uri	http://hdl.handle.net/10400.5/96147
dc.language.iso	eng	pt_PT
dc.publisher	APDIO	pt_PT
dc.subject	Integer Linear Programming	pt_PT
dc.subject	Covering Problems	pt_PT
dc.subject	Lagrangean Relaxation	pt_PT
dc.subject	Penalties	pt_PT
dc.title	Linear and Lagrangean Penalties for ILP. An Application to a Covering Problem	pt_PT
dc.type	journal article
dspace.entity.type	Publication
rcaap.rights	openAccess	pt_PT
rcaap.type	article	pt_PT

Files

Now showing 1 - 1 of 1

Name:: Linear and Lagrangean Penalties for ILP. An Application to a Covering Problem_IO_ vol.12_pp. 43-50_1992.pdf
Size:: 303.86 KB
Format:: Adobe Portable Document Format

Now showing 1 - 1 of 1