Mladenovic Nenad

Nenad Mladenovic

Information about the author Nenad Mladenovic will soon be added to the site.
Found 17 papers in total
General Variable Neighborhood Search for computing graph separators
General Variable Neighborhood Search for computing graph separators
2017
Computing graph separators in networks has a wide range of real‐world...
New MIP model for multiprocessor scheduling problem with communication delays
New MIP model for multiprocessor scheduling problem with communication delays
2017
In this paper we consider scheduling tasks on a multiprocessor system, taking into...
Solving the clique partitioning problem as a maximally diverse grouping problem
Solving the clique partitioning problem as a maximally diverse grouping problem
2017
In this paper we show that the clique partitioning problem can be reformulated in an...
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
2017
In a single local search algorithm, several neighborhood structures are usually...
Comparison of metaheuristics for the k-labeled spanning forest problem
Comparison of metaheuristics for the k-labeled spanning forest problem
2017
In this paper, we study the k‐labeled spanning forest (kLSF) problem in which...
New local searches for solving the multi-source Weber problem
New local searches for solving the multi-source Weber problem
2016
This paper presents three new heuristic approaches for the solution of the...
New heuristic algorithms for solving the planar p-median problem
New heuristic algorithms for solving the planar p-median problem
2015
In this paper we propose effective heuristics for the solution of the planar p...
Sequential clustering with radius and split criteria
Sequential clustering with radius and split criteria
2013
Sequential clustering aims at determining homogeneous and/or well‐separated...
New exact method for large asymmetric distance‐constrained vehicle routing problem
New exact method for large asymmetric distance‐constrained vehicle routing problem
2013
In this paper we revise and modify an old branch‐and‐bound method for...
Variable neighborhood search for location routing
Variable neighborhood search for location routing
2013
In this paper we propose various neighborhood search heuristics (VNS) for solving the...
A general variable neighborhood search for the one‐commodity pickup‐and‐delivery travelling salesman problem
A general variable neighborhood search for the one‐commodity pickup‐and‐delivery travelling salesman problem
2012
We present a variable neighborhood search approach for solving the...
Gaussian variable neighborhood search for continuous optimization
Gaussian variable neighborhood search for continuous optimization
2012
Variable Neighborhood Search (VNS) has shown to be a powerful tool for solving both...
Attraction probabilities in variable neighborhood search
Attraction probabilities in variable neighborhood search
2010
Empirical evidence demonstrates that when the same local search operator is used,...
Variable neighbourhood search: methods and applications
Variable neighbourhood search: methods and applications
2008
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building...
A descent-ascent technique for solving the multi-source Weber problem
A descent-ascent technique for solving the multi-source Weber problem
1995
The multi-source Weber problem requires locating m new facilities in continuous space...
Some properties of transportation manifold
Some properties of transportation manifold
1991
In this paper it is shown that the set of equality constraints of transportation...
A comparison of algorithms for the maximum clique problem
A comparison of algorithms for the maximum clique problem
1992
Five recent practically efficient methods for solving the maximum clique problem are...
Papers per page: