Nenad Mladenovic

According to our database1, Nenad Mladenovic authored at least 162 papers between 1993 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing.
J. Sched., 2020

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

Preface to the special issue "ICVNS 2018".
J. Glob. Optim., 2020

Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines.
J. Glob. Optim., 2020

Revenue maximization of Internet of things provider using variable neighbourhood search.
J. Glob. Optim., 2020

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

Exponential quality function for community detection in complex networks.
Int. Trans. Oper. Res., 2020

Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach.
Inf. Sci., 2020

2019
VNDS for the min-power symmetric connectivity problem.
Optim. Lett., 2019

Variable neighborhood search for stochastic linear programming problem with quantile criterion.
J. Glob. Optim., 2019

Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations.
INFORMS J. Comput., 2019

Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization.
Ann. Oper. Res., 2019

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

Variable Neighborhood Search for a Two-Stage Stochastic Programming Problem with a Quantile Criterion.
Autom. Remote. Control., 2019

Less Is More: Tabu Search for Bipartite Quadratic Programming Problem.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

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

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

Efficient heuristics for the minimum labeling global cut problem.
Electron. Notes Discret. Math., 2018

On the k-Medoids Model for Semi-supervised Clustering.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

Less Is More: The Neighborhood Guided Evolution Strategies Convergence on Some Classic Neighborhood Operators.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

2017
NP-Hardness of balanced minimum sum-of-squares clustering.
Pattern Recognit. Lett., 2017

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

General Variable Neighborhood Search for computing graph separators.
Optim. Lett., 2017

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

Preface of special issue BALCOR.
Optim. Lett., 2017

New MIP model for multiprocessor scheduling problem with communication delays.
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

Solving the clique partitioning problem as a maximally diverse grouping problem.
Optim. Lett., 2017

Special issue on "New trends in Variable Neighborhood Search".
Int. Trans. Oper. Res., 2017

Editorial to the Special Cluster on Variable Neighborhood Search, Variants and Recent Applications.
Int. Trans. Oper. Res., 2017

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

Comparison of metaheuristics for the <i>k</i>-labeled spanning forest problem.
Int. Trans. Oper. Res., 2017

Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering.
Inf. Sci., 2017

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

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

A performance study on multi improvement neighborhood search strategy.
Electron. Notes Discret. Math., 2017

Scheduling preventive railway maintenance activities with resource constraints.
Electron. Notes Discret. Math., 2017

New VNP for automatic programming.
Electron. Notes Discret. Math., 2017

Clustering approach in maintenance of capillary railway network.
Electron. Notes Discret. Math., 2017

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

On the aircraft conflict resolution problem: A VNS approach in a multiobjective framework.
Electron. Notes Discret. Math., 2017

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

Solving multifacility Huff location models on networks using metaheuristic and exact approaches.
Comput. Oper. Res., 2017

Variable neighborhood search variants for Min-power symmetric connectivity problem.
Comput. Oper. Res., 2017

Special issue on Variable neighborhood search methods in business and engineering.
Comput. Oper. Res., 2017

On Strategies to Fix Degenerate k-means Solutions.
J. Classif., 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

Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.
Evol. Comput., 2016

An adaptive perturbation-based heuristic: An application to the continuous p-centre problem.
Comput. Oper. Res., 2016

New local searches for solving the multi-source Weber problem.
Ann. Oper. Res., 2016

Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks.
Proceedings of the Discrete Optimization and Operations Research, 2016

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

2015
Fitting censored quantile regression by variable neighborhood search.
J. Glob. Optim., 2015

Multi-objective variable neighborhood search: an application to combinatorial optimization problems.
J. Glob. Optim., 2015

Solving the planar p-median problem by variable neighborhood and concentric searches.
J. Glob. Optim., 2015

New heuristic for harmonic means clustering.
J. Glob. Optim., 2015

A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes.
J. Glob. Optim., 2015

Solving the maximally diverse grouping problem by skewed general variable neighborhood search.
Inf. Sci., 2015

Clustering cities based on their development dynamics and Variable neigborhood search.
Electron. Notes Discret. Math., 2015

Towards an intelligent VNS heuristic for the k-labelled spanning forest problem.
CoRR, 2015

BVNS para el problema del bosque generador k-etiquetado.
CoRR, 2015

Skewed general variable neighborhood search for the location routing scheduling problem.
Comput. Oper. Res., 2015

New heuristic algorithms for solving the planar p-median problem.
Comput. Oper. Res., 2015

Solving the minimum labelling spanning tree problem by intelligent optimization.
Appl. Soft Comput., 2015

2014
Variable Neighborhood Search for Edge-Ratio Network Clustering.
Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

A new local search for continuous location problems.
Eur. J. Oper. Res., 2014

Mejora de la exploracion y la explotacion de las heuristicas constructivas para el MLSTP.
CoRR, 2014

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

Editorial.
Comput. Oper. Res., 2014

A two phase variable neighborhood search for the multi-product inventory routing problem.
Comput. Oper. Res., 2014

DE-VNS: Self-adaptive Differential Evolution with crossover neighborhood search for continuous global optimization.
Comput. Oper. Res., 2014

A variable neighborhood search particle filter for bearings-only target tracking.
Comput. Oper. Res., 2014

Erratum to: "Fast metaheuristics for the discrete (r|p)-centroid problem".
Autom. Remote. Control., 2014

Fast metaheuristics for the discrete (r|p)-centroid problem.
Autom. Remote. Control., 2014

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

New exact method for large asymmetric distance-constrained vehicle routing problem.
Eur. J. Oper. Res., 2013

Intelligent variable neighbourhood search for the minimum labelling spanning tree problem.
Electron. Notes Discret. Math., 2013

Packing unit spheres into the smallest sphere using VNS and NLP.
Comput. Oper. Res., 2013

Variable neighborhood search for location routing.
Comput. Oper. Res., 2013

Sequential clustering with radius and split criteria.
Central Eur. J. Oper. Res., 2013

Variable Formulation Search for the Cutwidth Minimization Problem.
Appl. Soft Comput., 2013

Routing of barge container ships by mixed-integer programming heuristics.
Appl. Soft Comput., 2013

Variable neighborhood search for the travelling deliveryman problem.
4OR, 2013

Intelligent Optimization for the Minimum Labelling Spanning Tree Problem.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

2012
A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem.
Eur. J. Oper. Res., 2012

Variable neighborhood search for metric dimension and minimal doubly resolving set problems.
Eur. J. Oper. Res., 2012

EURO Mini Conference (MEC XXVIII) on Variable Neighborhood Search.
Electron. Notes Discret. Math., 2012

Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics.
Electron. Notes Discret. Math., 2012

A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem.
Electron. Notes Discret. Math., 2012

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

Variable neighborhood search for the strong metric dimension problem.
Electron. Notes Discret. Math., 2012

Generating good starting solutions for the p-median problem in the plane.
Electron. Notes Discret. Math., 2012

VNS based algorithm for solving a 0-1 nonlinear nonconvex model for the Collision Avoidance in Air Traffic Management.
Electron. Notes Discret. Math., 2012

Variable neighborhood search for the Vertex Separation Problem.
Comput. Oper. Res., 2012

Gaussian variable neighborhood search for continuous optimization.
Comput. Oper. Res., 2012

2011
A recipe for finding good solutions to MINLPs.
Math. Program. Comput., 2011

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

Maximizing edge-ratio is NP-complete.
Discret. Appl. Math., 2011

2010
A Good Recipe for Solving MINLPs.
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem.
Nat. Comput., 2010

Exact and heuristic solutions of the global supply chain problem with transfer pricing.
Eur. J. Oper. Res., 2010

Variable neighbourhood search for bandwidth reduction.
Eur. J. Oper. Res., 2010

A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem.
Eur. J. Oper. Res., 2010

Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem.
Electron. Notes Discret. Math., 2010

Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility.
Electron. Notes Discret. Math., 2010

Variable neighbourhood decomposition search for 0-1 mixed integer programs.
Comput. Oper. Res., 2010

Variable neighbourhood search: methods and applications.
Ann. Oper. Res., 2010

A variable neighborhood search based algorithm for finite-horizon Markov Decision Processes.
Appl. Math. Comput., 2010

Attraction probabilities in variable neighborhood search.
4OR, 2010

New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

2009
Variable Neighborhood Search Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Extension of the Weiszfeld procedure to a single facility minisum location model with mixed <i>ℓ</i><sub><i>p</i></sub> norms.
Math. Methods Oper. Res., 2009

Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem.
Eur. J. Oper. Res., 2009

Solving large <i>p</i>-median clustering problems by primal-dual variable neighborhood search.
Data Min. Knowl. Discov., 2009

A restarted and modified simplex search for unconstrained optimization.
Comput. Oper. Res., 2009

Variable neighborhood search for the heaviest k-subgraph.
Comput. Oper. Res., 2009

Variable neighbourhood search for the minimum labelling Steiner tree problem.
Ann. Oper. Res., 2009

2008
Complement to a comparative analysis of heuristics for the <i>p</i> -median problem.
Stat. Comput., 2008

The maximum return-on-investment plant location problem with market share.
J. Oper. Res. Soc., 2008

Local and variable neighborhood search for the <i>k</i> -cardinality subgraph problem.
J. Heuristics, 2008

General variable neighborhood search for the continuous optimization.
Eur. J. Oper. Res., 2008

Variable neighborhood search for minimum cost berth allocation.
Eur. J. Oper. Res., 2008

Variable neighborhood search.
Eur. J. Oper. Res., 2008

A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule.
Eur. J. Oper. Res., 2008

2007
Discrete Particle Swarm Optimization for the Minimum Labelling Steiner Tree Problem.
Proceedings of the Nature Inspired Cooperative Strategies for Optimization (NICSO 2007), 2007

Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem.
INFORMS J. Comput., 2007

The p-median problem: A survey of metaheuristic approaches.
Eur. J. Oper. Res., 2007

Formulation Space Search for Circle Packing Problems.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

Variable Neighborhood Search for the Probabilistic Satisfiability Problem.
Proceedings of the Metaheuristics, 2007

2006
A note on duality gap in the simple plant location problem.
Eur. J. Oper. Res., 2006

Variable neighborhood search for the vertex weighted k.
Eur. J. Oper. Res., 2006

First vs. best improvement: An empirical study.
Discret. Appl. Math., 2006

Variable neighborhood search and local branching.
Comput. Oper. Res., 2006

2005
Design of balanced MBA student teams.
J. Oper. Res. Soc., 2005

Reformulation descent applied to circle packing problems.
Comput. Oper. Res., 2005

Analysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering.
J. Classif., 2005

Permutation-Based Genetic, Tabu, and Variable Neighborhood Search Heuristics for Multiprocessor Scheduling with Communication delays.
Asia Pac. J. Oper. Res., 2005

Heuristic Procedures for Solving the Discrete Ordered Median Problem.
Ann. Oper. Res., 2005

A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem.
Proceedings of the Hybrid Metaheuristics, Second International Workshop, 2005

2004
Pooling Problem: Alternate Formulations and Solution Methods.
Manag. Sci., 2004

The multi-source Weber problem with constant opening cost.
J. Oper. Res. Soc., 2004

Cooperative Parallel Variable Neighborhood Search for the <i>p</i>-Median.
J. Heuristics, 2004

Variable neighborhood search for the maximum clique.
Discret. Appl. Math., 2004

Variable neighborhood decomposition search for the edge weighted <i>k</i>-cardinality tree problem.
Comput. Oper. Res., 2004

2003
Solving the p-Center problem with Tabu Search and Variable Neighborhood Search.
Networks, 2003

An Oil Pipeline Design Problem.
Oper. Res., 2003

Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
Eur. J. Oper. Res., 2003

Búsqueda de Entorno Variable.
Inteligencia Artif., 2003

2002
Fuzzy J-Means: a new heuristic for fuzzy clustering.
Pattern Recognit., 2002

A note on reduction of quadratic and bilinear programs with equality constraints.
J. Glob. Optim., 2002

2001
J-M<sub>EANS</sub>: a new local search heuristic for minimum sum of squares clustering.
Pattern Recognit., 2001

Variable Neighborhood Decomposition Search.
J. Heuristics, 2001

Variable neighborhood search: Principles and applications.
Eur. J. Oper. Res., 2001

2000
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem.
Oper. Res., 2000

1999
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering.
SIAM J. Sci. Comput., 1999

Degeneracy in the multi-source Weber problem.
Math. Program., 1999

1998
Heuristic solution of the multisource Weber problem as a p-median problem.
Oper. Res. Lett., 1998

1997
Variable neighborhood search.
Comput. Oper. Res., 1997

1993
How to Choose K Entities Among N.
Proceedings of the Partitioning Data Sets, Proceedings of a DIMACS Workshop, 1993


  Loading...