DC FieldValueLanguage
dc.contributor.authorStanojević, Milanen_US
dc.contributor.authorStanojević, Bogdanaen_US
dc.date.accessioned2021-12-06T09:26:54Z-
dc.date.available2021-12-06T09:26:54Z-
dc.date.issued2021-
dc.identifier.isbn978-86-7589-151-2-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4727-
dc.description.abstractIn this paper we introduce a novel algorithm for finding all non-dominated points of MOCO problems. Likewise a branch and bound method, our algorithm splits the feasible set in certain smaller sub-sets, and then performs the optimization of an aggregation of the original objective functions over each sub-set. However, the defined sub-sets are non-disjunctive, and in order to reduce the computational complexity, our implementation memorizes two lists of bounds: one containing those bounds that were found infeasible, and another containing the bounds that were successfully used in previous optimization steps. We report our numerical results obtained by solving multiple objective knapsack problems from a benchmark found in the literature.en_US
dc.publisherUniversity of Belgrade, Faculty of Mathematicsen_US
dc.subjectMultiple Objective Combinatorial Optimization | Branch and Bound | Hybrid Methoden_US
dc.titleAn algorithm based on Branch-and-Bound method for finding all non-dominated points of MOCO problemen_US
dc.typeConference Paperen_US
dc.relation.conferenceXLVIII International Symposium on Operational Research, SYM-OP-IS 2021, Banja Koviljača, 20-23. septembar 2021.en_US
dc.identifier.urlhttp://symopis2021.matf.bg.ac.rs/download/Zbornik-SYM-OP-IS2021.pdf-
dc.contributor.affiliationComputer Scienceen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage689-
dc.relation.lastpage694-
dc.description.rankM33-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeConference Paper-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-4524-5354-
Show simple item record

Page view(s)

49
checked on May 9, 2024

Google ScholarTM

Check

Altmetric


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