default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Miskovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j11]Olivera Stancic
, Zorica Stanimirovic, Raca Todosijevic, Stefan Miskovic:
Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem. Discret. Optim. 43: 100672 (2022)- [j10]Jack Brimberg, Stefan Miskovic, Raca Todosijevic, Dragan Urosevic:
The uncapacitated r-allocation p-hub center problem. Int. Trans. Oper. Res. 29(2): 854-878 (2022) - 2020
- [j9]Milan Bankovic, Vladimir Filipovic, Jelena Graovac, Jelena Hadzi-Puric, Ali R. Hurson, Aleksandar Kartelj, Jovana J. Kovacevic, Nenad Korolija, Milos Kotlar, Nenad B. Krdzavac, Filip Maric, Sasa N. Malkov, Veljko Milutinovic, Nenad S. Mitic, Stefan Miskovic, Mladen Nikolic, Gordana Pavlovic-Lazetic, Danijela Simic, Miodrag V. Zivkovic:
Chapter One - Teaching graduate students how to review research articles and respond to reviewer comments. Adv. Comput. 116: 1-63 (2020) - 2017
- [j8]Olivera Jankovic, Stefan Miskovic, Zorica Stanimirovic, Raca Todosijevic:
Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems. Ann. Oper. Res. 259(1-2): 191-216 (2017) - [j7]Zorica Stanimirovic, Stefan Miskovic, Darko Trifunovic, Veselin Veljovic:
A Two-Phase Optimization Method for Solving the Multi-Type Maximal Covering Location Problem in Emergency Service Networks. Inf. Technol. Control. 46(1): 100-117 (2017) - [j6]Stefan Miskovic, Zorica Stanimirovic, Igor Grujicic:
Solving the robust two-stage capacitated facility location problem with uncertain transportation costs. Optim. Lett. 11(6): 1169-1184 (2017) - [j5]Stefan Miskovic:
A VNS-LP algorithm for the robust dynamic maximal covering location problem. OR Spectr. 39(4): 1011-1033 (2017) - 2016
- [j4]Stefan Miskovic, Zorica Stanimirovic:
Hybrid metaheuristic method for solving a multi-period emergency service location problem. Inf. Technol. Control. 45(3): 321-337 (2016) - 2015
- [j3]Stefan Miskovic, Zorica Stanimirovic, Igor Grujicic:
An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network. Electron. Notes Discret. Math. 47: 261-268 (2015) - 2014
- [j2]Zorica Stanimirovic, Stefan Miskovic:
A Hybrid Evolutionary Algorithm for Efficient Exploration of Online Social Networks. Comput. Informatics 33(2): 410-430 (2014) - 2013
- [j1]Stefan Miskovic, Zorica Stanimirovic:
A Memetic Algorithm for Solving Two Variants of the Two-Stage Uncapacitated Facility Location Problem. Inf. Technol. Control. 42(2): 178-190 (2013)
Conference and Workshop Papers
- 2015
- [c1]Stefan Miskovic, Zorica Stanimirovic:
Memetic algorithm for the balanced resource location problem with preferences. IISA 2015: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
