Mladenovi Nenad

Nenad Mladenovi

Information about the author Nenad Mladenovi will soon be added to the site.
Found 28 papers in total
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem
2017
The p ‐hub median problem consists of choosing p hub locations from a set of...
Variable neighborhood search for the travelling deliveryman problem
Variable neighborhood search for the travelling deliveryman problem
2013
A travelling deliveryman needs to find a tour such that the total waiting time of all...
Variable neighborhood search for metric dimension and minimal doubly resolving set problems
Variable neighborhood search for metric dimension and minimal doubly resolving set problems
2012
In this paper, two similar NP‐hard optimization problems on graphs are...
Variable neighbourhood decomposition search for 0–1 mixed integer programs
Variable neighbourhood decomposition search for 0–1 mixed integer programs
2010
In this paper we propose a new hybrid heuristic for solving 0–1 mixed integer...
Variable neighbourhood search: methods and applications
Variable neighbourhood search: methods and applications
2010
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building...
Variable neighbourhood search for the minimum labelling Steiner tree problem
Variable neighbourhood search for the minimum labelling Steiner tree problem
2009
We present a study on heuristic solution approaches to the minimum labelling Steiner...
Extension of the Weiszfeld procedure to a single facility minisum location model with mixed l p norms
Extension of the Weiszfeld procedure to a single facility minisum location model with mixed l p norms
2009
This paper presents a general mixed-norm minisum problem for locating a single...
Primal-dual variable neighborhood search for the simple plant-location problem
Primal-dual variable neighborhood search for the simple plant-location problem
2007
The variable neighborhood search metaheuristic is applied to the primal simple...
The p-median problem: A survey of metaheuristic approaches
The p-median problem: A survey of metaheuristic approaches
2007
The p -median problem is one of the basic models in discrete location theory. As with...
Variable neighbourhood search for colour image quantization
Variable neighbourhood search for colour image quantization
2007
Colour image quantization is a data compression technique that reduces the total set...
Decomposition strategies for large-scale continuous location–allocation problems
Decomposition strategies for large-scale continuous location–allocation problems
2006
The continuous location–allocation problem requires finding sites for m new...
Pooling problem: Alternate formulations and solution methods
Pooling problem: Alternate formulations and solution methods
2004
The pooling problem, which is fundamental to the petroleum industry, describes a...
Variable neighborhood search and local branching
Variable neighborhood search and local branching
2006
In this paper we develop a variable neighborhood search (VNS) heuristic for solving...
Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays
Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays
2005
The multiprocessor scheduling problem with communication delays that we consider in...
Reformulation descent applied to circle packing problems
Reformulation descent applied to circle packing problems
2005
Several years ago classical Euclidean geometry problems of densest packing of circles...
Heuristic procedures for solving the discrete ordered median problem
Heuristic procedures for solving the discrete ordered median problem
2005
We present two heuristic methods for solving the Discrete Ordered Median Problem...
Cooperative parallel variable neighborhood search for the p-median
Cooperative parallel variable neighborhood search for the p-median
2004
We propose a cooperative multi-search method for the Variable Neighborhood Search...
Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem
Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem
2004
The minimum k -cardinality tree problem on graph G consists in finding a subtree of G...
A separable approximation dynamic programming algorithm for economic dispatch with transmission losses
A separable approximation dynamic programming algorithm for economic dispatch with transmission losses
2002
The standard way to solve the static economic dispatch problem with transmission...
An oil pipeline design problem
An oil pipeline design problem
2003
We consider a given set of offshore platforms and onshore wells producing known (or...
Solving the p-Center problem with tabu search and variable neighborhood search
Solving the p-Center problem with tabu search and variable neighborhood search
2003
The p -Center problem consists of locating p facilities and assigning clients to them...
A separable approximation dynamic programming algorithm for economic dispatch with transmission losses
A separable approximation dynamic programming algorithm for economic dispatch with transmission losses
2002
The standard way to solve the static economic dispatch problem with transmission...
Variable neighborhood search: Principles and applications
Variable neighborhood search: Principles and applications
2001
Systematic change of neighborhood within a possibly randomized local search algorithm...
Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem
Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem
2000
The multisource Weber problem is to locate simultaneously m facilities in the...
Papers per page: