A Lagrangian bound for many-to-many assignment problems

dc.contributorUANL
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T15:30:18Z
dc.date.accessioned2022-10-05T16:58:33Z
dc.date.available2014-05-20T15:30:18Z
dc.date.available2022-10-05T16:58:33Z
dc.date.created2014-05-20T15:30:18Z
dc.date.issued2010-04-01
dc.identifierJournal of Combinatorial Optimization. Dordrecht: Springer, v. 19, n. 3, p. 241-257, 2010.
dc.identifier1382-6905
dc.identifierhttp://hdl.handle.net/11449/39723
dc.identifier10.1007/s10878-008-9196-3
dc.identifierWOS:000275781900001
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3910783
dc.description.abstractA 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.
dc.languageeng
dc.publisherSpringer
dc.relationJournal of Combinatorial Optimization
dc.relation0.927
dc.relation0,579
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectLagrangian bounds
dc.subjectInteger programming
dc.subjectMany-to-many-assignment problem
dc.titleA Lagrangian bound for many-to-many assignment problems
dc.typeArtigo


Este ítem pertenece a la siguiente institución