default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaca Todosijevic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j43]Dalibor Ristic
, Nenad Mladenovic, Mustapha Ratli, Raca Todosijevic, Dragan Urosevic:
Auxiliary data structures and techniques to speed up solving of the p-next center problem: A VNS heuristic. Appl. Soft Comput. 140: 110276 (2023)- [j42]Dalibor Ristic, Dragan Urosevic, Nenad Mladenovic, Raca Todosijevic:
Solving the p-second center problem with variable neighborhood search. Comput. Sci. Inf. Syst. 20(1): 95-115 (2023) - [j41]Jack Brimberg, Saïd Salhi, Raca Todosijevic, Dragan Urosevic:
Variable Neighborhood Search: The power of change and simplicity. Comput. Oper. Res. 155: 106221 (2023) - [j40]Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville:
Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem. Eur. J. Oper. Res. 304(3): 901-911 (2023) - [j39]Afaf Aloullal, Francisco Saldanha-da-Gama, Raca Todosijevic:
Multi-period single-allocation hub location-routing: Models and heuristic solutions. Eur. J. Oper. Res. 310(1): 53-70 (2023) - [j38]Issam Krimi, Rachid Benmansour, Raca Todosijevic, Nenad Mladenovic, Mustapha Ratli:
A no-delay single machine scheduling problem to minimize total weighted early and late work. Optim. Lett. 17(9): 2113-2131 (2023) - [j37]Issam Krimi, Rachid Benmansour, Raca Todosijevic, Nenad Mladenovic, Mustapha Ratli:
Correction to: A no-delay single machine scheduling problem to minimize total weighted early and late work. Optim. Lett. 17(9): 2133-2134 (2023) - [j36]Rachid Benmansour, Raca Todosijevic, Saïd Hanafi:
Variable neighborhood search for the single machine scheduling problem to minimize the total early work. Optim. Lett. 17(9): 2169-2184 (2023) - 2022
- [j35]Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville:
Variable neighborhood search for the discounted {0-1} knapsack problem. Appl. Soft Comput. 131: 109821 (2022) - [j34]Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic, Mustapha Ratli:
Solving the Capacitated Dispersion Problem with variable neighborhood search approaches: From basic to skewed VNS. Comput. Oper. Res. 139: 105622 (2022) - [j33]Raca Todosijevic, Saïd Hanafi, Fred W. Glover:
On convergence of scatter search and star paths with directional rounding for 0-1 mixed integer programs. Discret. Appl. Math. 308: 235-254 (2022) - [j32]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) - [j31]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) - [j30]Mustapha Ratli, Dragan Urosevic, Abdessamad Ait El Cadi, Jack Brimberg, Nenad Mladenovic, Raca Todosijevic:
An efficient heuristic for a hub location routing problem. Optim. Lett. 16(1): 281-300 (2022) - 2021
- [j29]Jack Brimberg, Raca Todosijevic, Dragan Urosevic, Nenad Mladenovic:
Efficient flow models for the uncapacitated multiple allocation p-hub median problem on non-triangular networks. Comput. Ind. Eng. 162: 107723 (2021) - 2020
- [j28]Shahin Gelareh, Bernard Gendron, Saïd Hanafi, Rahimeh Neamatian Monemi, Raca Todosijevic:
The selective traveling salesman problem with draft limits. J. Heuristics 26(3): 339-352 (2020) - [j27]Nenad Mladenovic, Abdulaziz Alkandari, Jun Pei, Raca Todosijevic, Panos M. Pardalos:
Less is more approach: basic variable neighborhood search for the obnoxious p-median problem. Int. Trans. Oper. Res. 27(1): 480-493 (2020) - [j26]Issam Krimi, Raca Todosijevic, Rachid Benmansour, Mustapha Ratli, Abdessamad Ait El Cadi, Afaf Aloullal:
Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints. J. Glob. Optim. 78(2): 349-373 (2020) - [j25]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
A non-triangular hub location problem. Optim. Lett. 14(5): 1107-1126 (2020) - [i1]El-Ghazali Talbi, Raca Todosijevic:
Recovery-to-Efficiency: A New Robustness Concept for Multi-objective Optimization under Uncertainty. CoRR abs/2011.10341 (2020)
2010 – 2019
- 2019
- [j24]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Solving the capacitated clustering problem with variable neighborhood search. Ann. Oper. Res. 272(1-2): 289-321 (2019) - [j23]Marija Mikic, Raca Todosijevic, Dragan Urosevic:
Less is more: General variable neighborhood search for the capacitated modular hub location problem. Comput. Oper. Res. 110: 101-115 (2019) - [j22]Oualid Guemri, Placide Nduwayo, Raca Todosijevic, Saïd Hanafi, Fred W. Glover:
Probabilistic Tabu Search for the Cross-Docking Assignment Problem. Eur. J. Oper. Res. 277(3): 875-885 (2019) - 2018
- [j21]Bernard Gendron, Saïd Hanafi, Raca Todosijevic:
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design. Eur. J. Oper. Res. 268(1): 70-81 (2018) - [r1]Abraham Duarte, Jesús Sánchez-Oro, Nenad Mladenovic, Raca Todosijevic:
Variable Neighborhood Descent. Handbook of Heuristics 2018: 341-367 - 2017
- [j20]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) - [j19]El-Ghazali Talbi, Raca Todosijevic:
The robust uncapacitated multiple allocation p-hub median problem. Comput. Ind. Eng. 110: 322-332 (2017) - [j18]Raca Todosijevic, Saïd Hanafi, Dragan Urosevic, Bassem Jarboui, Bernard Gendron:
A general variable neighborhood search for the swap-body vehicle routing problem. Comput. Oper. Res. 78: 468-479 (2017) - [j17]Pierre Hansen, Nenad Mladenovic, Raca Todosijevic, Saïd Hanafi:
Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3): 423-454 (2017) - [j16]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
A general framework for nested variable neighborhood search. Electron. Notes Discret. Math. 58: 159-166 (2017) - [j15]Zhazira Amirgaliyeva, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Solving the maximum min-sum dispersion by alternating formulations of two different problems. Eur. J. Oper. Res. 260(2): 444-459 (2017) - [j14]Saïd Hanafi, Raca Todosijevic:
Mathematical programming based heuristics for the 0-1 MIP: a survey. J. Heuristics 23(4): 165-206 (2017) - [j13]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Less is more: Solving the Max-Mean diversity problem with variable neighborhood search. Inf. Sci. 382-383: 179-200 (2017) - [j12]Anis Mjirda, Raca Todosijevic, Saïd Hanafi, Pierre Hansen, Nenad Mladenovic:
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24(3): 615-633 (2017) - [j11]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem. Optim. Lett. 11(2): 313-327 (2017) - [j10]Alexey Nikolaev, Nenad Mladenovic, Raca Todosijevic:
J-means and I-means for minimum sum-of-squares clustering on networks. Optim. Lett. 11(2): 359-376 (2017) - [j9]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
General variable neighborhood search for the uncapacitated single allocation p-hub center problem. Optim. Lett. 11(2): 377-388 (2017) - [j8]Raca Todosijevic, Anis Mjirda, Marko Mladenovic, Saïd Hanafi, Bernard Gendron:
A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim. Lett. 11(6): 1047-1056 (2017) - [j7]Raca Todosijevic, Dragan Urosevic, Nenad Mladenovic, Saïd Hanafi:
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optim. Lett. 11(6): 1109-1121 (2017) - 2016
- [j6]Raca Todosijevic, Rachid Benmansour, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba:
Nested general variable neighborhood search for the periodic maintenance problem. Eur. J. Oper. Res. 252(2): 385-396 (2016) - [j5]Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Less is more: Basic variable neighborhood search for minimum differential dispersion problem. Inf. Sci. 326: 160-171 (2016) - [c1]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Variable Neighborhood Descent for the Capacitated Clustering Problem. DOOR 2016: 336-349 - 2015
- [b1]Raca Todosijevic:
Theoretical and practical contributions on scatter search, variable neighborhood search and matheuristics for 0-1 mixed integer programs. (Contributions théoriques et pratiques pour la recherche dispersée, recherche à voisinage variable et matheuristique pour les programmes en nombres entiers mixtes). University of Valenciennes and Hainaut-Cambresis, France, 2015 - 2014
- [j4]Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Two level General variable neighborhood search for Attractive traveling salesman problem. Comput. Oper. Res. 52: 341-348 (2014) - 2013
- [j3]Emilio Carrizosa, Nenad Mladenovic, Raca Todosijevic:
Variable neighborhood search for minimum sum-of-squares clustering on networks. Eur. J. Oper. Res. 230(2): 356-363 (2013) - 2012
- [j2]Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
An efficient GVNS for solving Traveling Salesman Problem with Time Windows. Electron. Notes Discret. Math. 39: 83-90 (2012) - [j1]Raca Todosijevic, Marko Mladenovic, Saïd Hanafi, Igor Crévits:
VNS based heuristic for solving the Unit Commitment problem. Electron. Notes Discret. Math. 39: 153-160 (2012)
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:
