Show simple item record

Hub maximal covering problems - novel mathematical models and solution methods

dc.contributor.advisorStanimirović, Zorica
dc.contributor.otherDražić, Milan
dc.contributor.otherDavidović, Tatjana
dc.creatorСтанчић, Оливера С.
dc.date.accessioned2019-07-18T13:23:22Z
dc.date.available2019-07-18T13:23:22Z
dc.date.available2020-07-03T08:37:57Z
dc.date.issued2018-12-07
dc.identifier.urihttp://eteze.bg.ac.rs/application/showtheses?thesesId=6806
dc.identifier.urihttp://nardus.mpn.gov.rs/handle/123456789/11245
dc.identifier.urihttps://fedorabg.bg.ac.rs/fedora/get/o:19889/bdef:Content/download
dc.identifier.urihttp://vbs.rs/scripts/cobiss?command=DISPLAY&base=70036&RID=51492367
dc.description.abstractHab lokacijski problemi, zbog brojnih primena u raznim oblastima realnog života, predstavlja važnu klasu problema optimizacije...sr
dc.description.abstractHub Location Problems (HLP) represent an important class of optimization problems due to their numerous applications in many areas of real life. They often arise from practical situations that require routing of the flow from origin node (supplier) to the destination node (customer) under given conditions, such that the value of considered objective function is optimal. Hubs are special objects (nodes in the network) that represent centres for consolidation and flow collection between two selected locations - suppliers and customers. As transportation costs (per unit of flow) along the links that connect hub nodes are lower compared to other links in the network, directing the flow to hubs may lead to significant reductions of transportation cost in the network...en
dc.formatapplication/pdf
dc.languagesr
dc.publisherУниверзитет у Београду, Математички факултетsr
dc.relationinfo:eu-repo/grantAgreement/MESTD/Basic Research (BR or ON)/174015/RS//
dc.rightsopenAccessen
dc.sourceУниверзитет у Београдуsr
dc.subjectMatematičko modeliranjesr
dc.subjectmathematical modelingen
dc.subjectproblemi hab maksimalnog pokrivanjasr
dc.subjectgenetski algoritmisr
dc.subjectmetoda promenljivih okolinasr
dc.subjecthub maximal covering problemsen
dc.subjectbinary and partial coverageen
dc.subjectmetaheuristicsen
dc.subjectvariable neighborhood searchen
dc.subjectgreedy randomized adaptive search procedureen
dc.subjectgenetic algorithmen
dc.titleПроблеми хаб максималног покривања - нови математички модели и методе решавањаsr
dc.title.alternativeHub maximal covering problems - novel mathematical models and solution methodsen
dc.typedoctoralThesis
dc.rights.licenseBY-NC-ND
dc.identifier.fulltexthttp://nardus.mpn.gov.rs/bitstream/id/6343/Disertacija.pdf
dc.identifier.fulltexthttp://nardus.mpn.gov.rs/bitstream/id/6344/Olivera_Stancic_izvestaj_komisije.pdf


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record