DC FieldValueLanguage
dc.contributor.authorStanojević, Milanen
dc.contributor.authorVujošević, Mirkoen
dc.contributor.authorStanojević, Bogdanaen
dc.date.accessioned2020-05-01T20:12:55Z-
dc.date.available2020-05-01T20:12:55Z-
dc.date.issued2013-03-01en
dc.identifier.issn0167-6377en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1208-
dc.description.abstractIn this paper we formulate and prove two upper bounds for the nondominated set of multi-objective combinatorial optimization problems with integer coefficients. We also show that under certain assumptions, reasonable and applicable in the majority of practical problems, the number of nondominated points grows following a polynomial function.en
dc.publisherElsevier-
dc.relationMultimodal Biometry in Identity Management-
dc.relationOptimization of Distributive and Reverse Flows in Logistic Systems-
dc.relation.ispartofOperations Research Lettersen
dc.subjectCombinatorial optimization | Multi-objective optimization | Nondominated points seten
dc.titleOn the cardinality of the nondominated set of multi-objective combinatorial optimization problemsen
dc.typeArticleen
dc.identifier.doi10.1016/j.orl.2013.01.006en
dc.identifier.scopus2-s2.0-84873899714en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage197en
dc.relation.lastpage200en
dc.relation.issue2en
dc.relation.volume41en
dc.description.rankM23-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-4524-5354-
crisitem.project.funderNSF-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/null/7360067-
Show simple item record

SCOPUSTM   
Citations

4
checked on Apr 3, 2025

Page view(s)

16
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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