- idUS
- Listar por autor
Listar por autor "Mladenović, Nenad"
Mostrando ítems 1-6 de 6
-
Artículo
Gaussian variable neighborhood search for continuous optimization
Carrizosa Priego, Emilio José; Drazic, Milan; Drazic, Zorica; Mladenović, Nenad (PERGAMON-ELSEVIER SCIENCE LTD, 2012-01-01)Variable Neighborhood Search (VNS) has shown to be a powerful tool for solving both discrete and box-constrained continuous ...
-
Artículo
New heuristic for harmonic means clustering
Carrizosa Priego, Emilio José; Alguwaizani, Abdulrahman; Hansen, Pierre; Mladenović, Nenad (Springer, 2014-05-06)It is well known that some local search heuristics for K-clustering problems, such as k-means heuristic for minimum ...
-
Artículo
Solving multifacility Huff location models on networks using metaheuristic and exact approaches
Grohmann, Sanja; Urošević, Dragan; Carrizosa Priego, Emilio José; Mladenović, Nenad (PERGAMON-ELSEVIER SCIENCE LTD, 2016-03-16)In this paper we consider multifacility Huff facility location problem on networks. First, we introduce a slight modification ...
-
Artículo
Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics
Rocksandic, Sanja; Carrizosa Priego, Emilio José; Urosevic, Dragan; Mladenović, Nenad (Elsevier, 2012-12-01)We consider multifacility Huff location problems on networks. The mixed integer nonlinear optimization problem is solved using Variable Neighborhood Search and Multi-Start Local Search metaheuristics. Computational experience is reported.
-
Artículo
Sum-of-squares clustering on networks
Carrizosa Priego, Emilio José; Mladenović, Nenad; Todosijević, Raca (University of Belgrade, 2011)Finding p prototypes by minimizing the sum of the squared distances from a set of points to its closest prototype is a ...
-
Artículo
Variable neighborhood search for minimum sum-of-squares clustering on networks
Carrizosa Priego, Emilio José; Mladenović, Nenad; Todosijević, Raca (ELSEVIER SCIENCE BV, 2013-10-13)Euclidean Minimum Sum-of-Squares Clustering amounts to finding p prototypes by minimizing the sum of the squared Euclidean ...