Dragan Urosevic

Abdessamad Ait El Cadi

Optim. Lett., 2022

Less is more approach in optimization: a road to artificial intelligence.

[BibT_eX]

[DOI]

Optim. Lett., 2022

The uncapacitated r-allocation p-hub center problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2022

Solving the Capacitated Dispersion Problem with variable neighborhood search approaches: From basic to skewed VNS.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

Variable Neighborhood Search Approach to Community Detection Problem.

[BibT_eX]

[DOI]

Djordje Jovanovic

Tatjana Davidovic

Tatjana Jaksic Krüger

Dusan Ramljak

Proceedings of the Numerical Methods and Applications - 10th International Conference, 2022

COCP: Blockchain Proof-of-Useful-Work Leveraging Real-Life Applications.

[BibT_eX]

[DOI]

Tatjana Davidovic

Milan Todorovic

Dusan Ramljak

Tatjana Jaksic Krüger

Luka Matijevic

Djordje Jovanovic

Proceedings of the Fourth International Conference on Blockchain Computing and Applications, 2022

2021

Efficient flow models for the uncapacitated multiple allocation p-hub median problem on non-triangular networks.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2021

2020

A non-triangular hub location problem.

[BibT_eX]

[DOI]

Optim. Lett., 2020

Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach.

[BibT_eX]

[DOI]

Inf. Sci., 2020

2019

Variable neighborhood search for stochastic linear programming problem with quantile criterion.

[BibT_eX]

[DOI]

J. Glob. Optim., 2019

Less is more: General variable neighborhood search for the capacitated modular hub location problem.

[BibT_eX]

[DOI]

Marija Mikic

Comput. Oper. Res., 2019

Variable Neighborhood Search Approach for Solving Roman and Weak Roman Domination Problems on Graphs.

[BibT_eX]

[DOI]

Marija Ivanovic

Comput. Informatics, 2019

Solving the capacitated clustering problem with variable neighborhood search.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2019

Less Is More: Tabu Search for Bipartite Quadratic Programming Problem.

[BibT_eX]

[DOI]

Yiad Ibrahim Yousef Alghoul

Zhazira Amirgaliyeva

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

2017

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

[BibT_eX]

[DOI]

Optim. Lett., 2017

General variable neighborhood search for the uncapacitated single allocation p-hub center problem.

[BibT_eX]

[DOI]

Optim. Lett., 2017

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

[BibT_eX]

[DOI]

Optim. Lett., 2017

Solving the clique partitioning problem as a maximally diverse grouping problem.

[BibT_eX]

[DOI]

Optim. Lett., 2017

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

[BibT_eX]

[DOI]

Inf. Sci., 2017

Solving the maximum min-sum dispersion by alternating formulations of two different problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Scheduling preventive railway maintenance activities with resource constraints.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

A general framework for nested variable neighborhood search.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

A general variable neighborhood search for the swap-body vehicle routing problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

Solving multifacility Huff location models on networks using metaheuristic and exact approaches.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

2016

Less is more: Basic variable neighborhood search for minimum differential dispersion problem.

[BibT_eX]

[DOI]

Inf. Sci., 2016

Variable Neighborhood Descent for the Capacitated Clustering Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete Optimization and Operations Research, 2016

2015

Solving the maximally diverse grouping problem by skewed general variable neighborhood search.

[BibT_eX]

[DOI]

Inf. Sci., 2015

2014

Two level General variable neighborhood search for Attractive traveling salesman problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

Erratum to: "Fast metaheuristics for the discrete (r|p)-centroid problem".

[BibT_eX]

[DOI]

Autom. Remote. Control., 2014

Fast metaheuristics for the discrete (r|p)-centroid problem.

[BibT_eX]

[DOI]

Autom. Remote. Control., 2014

2013

Variable neighborhood search for the travelling deliveryman problem.

[BibT_eX]

[DOI]

Saïd Hanafi

4OR, 2013

2012

A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

EURO Mini Conference (MEC XXVIII) on Variable Neighborhood Search.

[BibT_eX]

[DOI]

Angelo Sifaleras

Electron. Notes Discret. Math., 2012

Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2012

An efficient GVNS for solving Traveling Salesman Problem with Time Windows.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2012

2011

Variable neighbourhood search for resolving routing and wavelength assignment problem in optical wavelength-division multiplexing networks.

[BibT_eX]

[DOI]

IET Commun., 2011

2010

Variable neighbourhood search for bandwidth reduction.

[BibT_eX]

[DOI]

Carlos G. García-González

Dionisio Pérez-Brito

Eur. J. Oper. Res., 2010

A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

Variable neighbourhood decomposition search for 0-1 mixed integer programs.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2010

2009

Solving large p-median clustering problems by primal-dual variable neighborhood search.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2009

A restarted and modified simplex search for unconstrained optimization.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

Variable neighborhood search for the heaviest k-subgraph.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

2008

The maximum return-on-investment plant location problem with market share.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2008

Local and variable neighborhood search for the k -cardinality subgraph problem.

[BibT_eX]

[DOI]

J. Heuristics, 2008

2007

Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2007

Formulation Space Search for Circle Packing Problems.

[BibT_eX]

[DOI]

Frank Plastria

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

2006

Variable neighborhood search for the vertex weighted k.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

Variable neighborhood search and local branching.

[BibT_eX]

[DOI]

Pierre Hansen

Comput. Oper. Res., 2006

2005

Reformulation descent applied to circle packing problems.

[BibT_eX]

[DOI]

Frank Plastria

Comput. Oper. Res., 2005

2004

Variable neighborhood search for the maximum clique.

[BibT_eX]

[DOI]

Pierre Hansen

Discret. Appl. Math., 2004

Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem.

[BibT_eX]

[DOI]