Raca Todosijevic

According to our database1, Raca Todosijevic authored at least 32 papers between 2012 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A non-triangular hub location problem.
Optim. Lett., 2020

Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints.
J. Glob. Optim., 2020

Less is more approach: basic variable neighborhood search for the obnoxious p-median problem.
Int. Trans. Oper. Res., 2020

The selective traveling salesman problem with draft limits.
J. Heuristics, 2020

Recovery-to-Efficiency: A New Robustness Concept for Multi-objective Optimization under Uncertainty.
CoRR, 2020

2019
Probabilistic Tabu Search for the Cross-Docking Assignment Problem.
Eur. J. Oper. Res., 2019

Less is more: General variable neighborhood search for the capacitated modular hub location problem.
Comput. Oper. Res., 2019

Solving the capacitated clustering problem with variable neighborhood search.
Ann. Oper. Res., 2019

2018
Variable Neighborhood Descent.
Proceedings of the Handbook of Heuristics., 2018

Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design.
Eur. J. Oper. Res., 2018

2017
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem.
Optim. Lett., 2017

A general variable neighborhood search variants for the travelling salesman problem with draft limits.
Optim. Lett., 2017

J-means and I-means for minimum sum-of-squares clustering on networks.
Optim. Lett., 2017

General variable neighborhood search for the uncapacitated single allocation p-hub center problem.
Optim. Lett., 2017

A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem.
Optim. Lett., 2017

Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem.
Int. Trans. Oper. Res., 2017

Less is more: Solving the Max-Mean diversity problem with variable neighborhood search.
Inf. Sci., 2017

Mathematical programming based heuristics for the 0-1 MIP: a survey.
J. Heuristics, 2017

Solving the maximum min-sum dispersion by alternating formulations of two different problems.
Eur. J. Oper. Res., 2017

A general framework for nested variable neighborhood search.
Electron. Notes Discret. Math., 2017

Variable neighborhood search: basics and variants.
EURO J. Comput. Optim., 2017

A general variable neighborhood search for the swap-body vehicle routing problem.
Comput. Oper. Res., 2017

The robust uncapacitated multiple allocation p-hub median problem.
Comput. Ind. Eng., 2017

Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems.
Ann. Oper. Res., 2017

2016
Less is more: Basic variable neighborhood search for minimum differential dispersion problem.
Inf. Sci., 2016

Nested general variable neighborhood search for the periodic maintenance problem.
Eur. J. Oper. Res., 2016

Variable Neighborhood Descent for the Capacitated Clustering Problem.
Proceedings of the Discrete Optimization and Operations Research, 2016

2015
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).
PhD thesis, 2015

2014
Two level General variable neighborhood search for Attractive traveling salesman problem.
Comput. Oper. Res., 2014

2013
Variable neighborhood search for minimum sum-of-squares clustering on networks.
Eur. J. Oper. Res., 2013

2012
VNS based heuristic for solving the Unit Commitment problem.
Electron. Notes Discret. Math., 2012

An efficient GVNS for solving Traveling Salesman Problem with Time Windows.
Electron. Notes Discret. Math., 2012


  Loading...