Zorica Stanimirovic
Orcid: 0000-0001-5658-4111
According to our database1,
Zorica Stanimirovic
authored at least 37 papers
between 2005 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2022
A variable neighborhood search for the budget-constrained maximal covering location problem with customer preference ordering.
Oper. Res., 2022
Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem.
Discret. Optim., 2022
A Multi-objective variable neighborhood search for the maximal covering location problem with customer preferences.
Clust. Comput., 2022
2021
Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation.
Oper. Res., 2021
Population-based Metaheuristics for the Dynamic Minimum Cost Hybrid Berth Allocation Problem.
Int. J. Artif. Intell. Tools, 2021
2020
Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture.
Int. Trans. Oper. Res., 2020
A bi-objective maximal covering location problem: a service network design application.
Proceedings of the International Conference on INnovations in Intelligent SysTems and Applications, 2020
2018
Variable Neighborhood Search Methods for the Dynamic Minimum Cost Hybrid Berth Allocation Problem.
Inf. Technol. Control., 2018
Skewed Variable Neighborhood Search Method for the Weighted Generalized Regenerator Location Problem.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018
General Variable Neighborhood Search for Scheduling Heterogeneous Vehicles in Agriculture.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018
2017
Solving the robust two-stage capacitated facility location problem with uncertain transportation costs.
Optim. Lett., 2017
A Two-Phase Optimization Method for Solving the Multi-Type Maximal Covering Location Problem in Emergency Service Networks.
Inf. Technol. Control., 2017
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub maximal covering problem.
Electron. Notes Discret. Math., 2017
Variable neighborhood search for optimizing the transportation of agricultural raw materials.
Electron. Notes Discret. Math., 2017
Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems.
Ann. Oper. Res., 2017
Elephant herding optimization algorithm for support vector machine parameters tuning.
Proceedings of the 9th International Conference on Electronics, 2017
2016
Hybrid metaheuristic method for solving a multi-period emergency service location problem.
Inf. Technol. Control., 2016
2015
An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network.
Electron. Notes Discret. Math., 2015
A hybridization of an evolutionary algorithm and a parallel branch and bound for solving the capacitated single allocation hub location problem.
Appl. Soft Comput., 2015
Hybrid metaheuristic method for determining locations for long-term health care facilities.
Ann. Oper. Res., 2015
Proceedings of the 6th International Conference on Information, 2015
Proceedings of the 6th International Conference on Information, 2015
2014
Memetic Algorithm for Solving the Multilevel Uncapacitated Facility Location Problem.
Informatica, 2014
Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations.
INFOR Inf. Syst. Oper. Res., 2014
Comput. Informatics, 2014
2013
An efficient memetic algorithm for the uncapacitated single allocation hub location problem.
Soft Comput., 2013
A Memetic Algorithm for Solving Two Variants of the Two-Stage Uncapacitated Facility Location Problem.
Inf. Technol. Control., 2013
2012
Inf. Technol. Control., 2012
Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences.
Electron. Notes Discret. Math., 2012
Variable neighborhood search method for optimizing the emergency service network of police special forces units.
Electron. Notes Discret. Math., 2012
2011
Appl. Soft Comput., 2011
2010
A Genetic Algorithm Approach for the Capacitated Single Allocation P-Hub Median Problem.
Comput. Informatics, 2010
2007
Eur. J. Oper. Res., 2007
Eur. J. Oper. Res., 2007
2006
Solving the uncapacitated Multiple Allocation P-Hub Center Problem by Genetic Algorithm.
Asia Pac. J. Oper. Res., 2006
2005
Genetic Algorithm for Solving Uncapacitated Multiple Allocation Hub Location Problem.
Comput. Artif. Intell., 2005