1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1521
DC FieldValueLanguage
dc.contributor.authorCvetković, Dragoš M.en_US
dc.contributor.authorČangalović, M.en_US
dc.contributor.authorDražić, Zoricaen_US
dc.contributor.authorVujčić, Vera V.en_US
dc.date.accessioned2025-02-21T20:14:07Z-
dc.date.available2025-02-21T20:14:07Z-
dc.date.issued2016-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1521-
dc.language.isoenen_US
dc.publisherBeograd : Ministarstvo odbraneen_US
dc.titleSome new complexity indices for the traveling salesman problemen_US
dc.typeConference Objecten_US
dc.relation.conferenceInternational Symposium on Operations Research SYM-OP-IS (43 ; 2016 ; Beograd)en_US
dc.relation.publicationProceedings of the 43rd International Symposium on Operations Research SYM-OP-IS 2016en_US
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.isbn978-86-335-0535-2en_US
dc.relation.firstpage283en_US
dc.relation.lastpage286en_US
item.openairetypeConference Object-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en-
crisitem.author.deptNumerical Mathematics and Optimization-
Appears in Collections:Research outputs
Show simple item record

Google ScholarTM

Check


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