Show simple item record

dc.contributor.authorLitvinchev, I. [UNESP]
dc.contributor.authorMata, M. [UNESP]
dc.contributor.authorSaucedo, J. [UNESP]
dc.contributor.authorRangel, S. [UNESP]
dc.date.accessioned2018-12-11T16:50:03Z
dc.date.available2018-12-11T16:50:03Z
dc.date.issued2017-09-01
dc.identifierhttp://dx.doi.org/10.1134/S1064230717050070
dc.identifier.citationJournal of Computer and Systems Sciences International, v. 56, n. 5, p. 803-809, 2017.
dc.identifier.issn1064-2307
dc.identifier.urihttp://hdl.handle.net/11449/170275
dc.description.abstractModified Lagrangian bounds are proposed for the generalized assignment problem. The approach is based on a double decomposable structure of the formulation. A family of greedy heuristics is considered to get Lagrangian based feasible solutions. Numerical results for problem instances with number of agents close to number of tasks are provided.en
dc.format.extent803-809
dc.language.isoeng
dc.relation.ispartofJournal of Computer and Systems Sciences International
dc.sourceScopus
dc.titleImproved Lagrangian bounds and heuristics for the generalized assignment problemen
dc.typeArtigo
dc.contributor.institutionComputing Center Russian Academy of Sciences
dc.contributor.institutionFaculty of Mechanical and Electrical Engineering(UANL)
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.description.affiliationComputing Center Russian Academy of Sciences
dc.description.affiliationFaculty of Mechanical and Electrical Engineering(UANL)
dc.description.affiliationDepartment of Applied Mathematics (UNESP)
dc.description.affiliationUnespDepartment of Applied Mathematics (UNESP)
dc.identifier.doi10.1134/S1064230717050070
dc.rights.accessRightsAcesso restrito
dc.identifier.scopus2-s2.0-85031429493
dc.relation.ispartofsjr0,316
Localize o texto completo

Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record