DC FieldValueLanguage
dc.contributor.authorHanafi, Saïden
dc.contributor.authorLazic, Jasminaen
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorWilbaut, Christopheen
dc.date.accessioned2020-05-02T16:42:10Z-
dc.date.available2020-05-02T16:42:10Z-
dc.date.issued2009-12-01en
dc.identifier.isbn978-3-902-66143-2en
dc.identifier.issn1474-6670en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2511-
dc.description.abstractIn this paper we propose a new heuristic for solving multidimensional knapsack problem, based on the variable neighbourhood decomposition search principle. The set of neighbourhoods is generated by exploiting information obtained from a series of relaxations. In each iteration, we add new constraints to the problem in order to produce a sequence of lower and upper bounds around the optimal value, with the goal to reduce the gap between them. General-purpose CPLEX MIP solver is used as a black box for solving subproblems generated during the search process. With this approach, we have managed to obtain promising results on a set of large scale multidimensional knapsack problem instances. The results are comparable with the current state-of-the-art techniques for solving multidimensional knapsack problem.en
dc.publisherElsevier-
dc.relation.ispartofIFAC Proceedings Volumes (IFAC-PapersOnline)en
dc.subject0-1 mixed integer programming | Combinatorial optimisation | CPLEX | Heuristics | Multidimensional knapsack problem | Variable neighbourhood decomposition searchen
dc.titleVariable neighbourhood decomposition search with bounding for multidimensional knapsack problemen
dc.typeConference Paperen
dc.relation.conference13th IFAC Symposium on Information Control Problems in Manufacturing, INCOM'09; Moscow; Russian Federation; 3 June 2009 through 5 June 2009-
dc.identifier.doi10.3182/20090603-3-RU-2001.0502en
dc.identifier.scopus2-s2.0-79960912283en
dc.relation.firstpage2018en
dc.relation.lastpage2022en
dc.relation.issuePART 1en
dc.relation.volume13en
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeConference Paper-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

3
checked on May 23, 2024

Page view(s)

52
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.