Nenad Mladenovic

Andrei Sleptchenko

Optim. Lett., December, 2023

A two-phase multi-objective metaheuristic for a green UAV grid routing problem.

[BibT_eX]

[DOI]

Optim. Lett., December, 2023

Correction to: A no-delay single machine scheduling problem to minimize total weighted early and late work.

[BibT_eX]

[DOI]

Optim. Lett., December, 2023

A no-delay single machine scheduling problem to minimize total weighted early and late work.

[BibT_eX]

[DOI]

Optim. Lett., December, 2023

A general variable neighborhood search approach for the minimum load coloring problem.

[BibT_eX]

[DOI]

Optim. Lett., December, 2023

Bi-level scheduling in high-end equipment R&D: when more algorithm strategies may not be better.

[BibT_eX]

[DOI]

Int. J. Prod. Res., August, 2023

Auxiliary data structures and techniques to speed up solving of the p-next center problem: A VNS heuristic.

[BibT_eX]

[DOI]

Appl. Soft Comput., June, 2023

How to Use K-means for Big Data Clustering?

[BibT_eX]

[DOI]

Pattern Recognit., May, 2023

Variable neighborhood search approach with intensified shake for monitor placement.

[BibT_eX]

[DOI]

Networks, April, 2023

Solving the p-second center problem with variable neighborhood search.

[BibT_eX]

[DOI]

Comput. Sci. Inf. Syst., 2023

2022

Optimization approaches for the urban delivery problem with trucks and drones.

[BibT_eX]

[DOI]

Swarm Evol. Comput., 2022

An efficient heuristic for a hub location routing problem.

[BibT_eX]

[DOI]

Mustapha Ratli

Abdessamad Ait El Cadi

Optim. Lett., 2022

Preface to the special issue on variable neighborhood search.

[BibT_eX]

[DOI]

Optim. Lett., 2022

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

[BibT_eX]

[DOI]

Optim. Lett., 2022

A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak.

[BibT_eX]

[DOI]

Optim. Lett., 2022

Variable neighborhood programming for symbolic regression.

[BibT_eX]

[DOI]

Optim. Lett., 2022

Preventive maintenance planning of railway infrastructure by reduced variable neighborhood programming.

[BibT_eX]

[DOI]

Souhir Elleuch

Bassem Jarboui

Optim. Lett., 2022

Solving a multiple-qualifications physician scheduling problem with multiple types of tasks by dynamic programming and variable neighborhood search.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2022

A mixed integer linear programming model and a basic variable neighbourhood search algorithm for the repatriation scheduling problem.

[BibT_eX]

[DOI]

Sameh Al-Shihabi

Expert Syst. Appl., 2022

Big-means: Less is More for K-means Clustering.

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

CTR DaPP: A Python Application for Design and Path Planning of Variable-strain Concentric Tube Robots.

[BibT_eX]

[DOI]

Proceedings of the 5th IEEE International Conference on Soft Robotics, 2022

A Metaheuristic Approach for Solving Monitor Placement Problem.

[BibT_eX]

[DOI]

Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022

An Effective VNS for Delivery Districting.

[BibT_eX]

[DOI]

Ahmed Aly

Adriana F. Gabor

Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022

A Simulation-Based Variable Neighborhood Search Approach for Optimizing Cross-Training Policies.

[BibT_eX]

[DOI]

Moustafa Abdelwanis

Andrei Sleptchenko

Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022

2021

A New Sentence-Based Interpretative Topic Modeling and Automatic Topic Labeling.

[BibT_eX]

[DOI]

Olzhas Kozbagarov

Rustam Mussabayev

Symmetry, 2021

Energy-efficient rescheduling with time-of-use energy cost: Application of variable neighborhood search algorithm.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2021

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

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2021

A survey on the applications of variable neighborhood search algorithm in healthcare management.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2021

Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem.

[BibT_eX]

[DOI]

Damir N. Gainanov

Varvara Rasskazova

Proceedings of the Variable Neighborhood Search - 8th International Conference, 2021

Using K-Means and Variable Neighborhood Search for Automatic Summarization of Scientific Articles.

[BibT_eX]

[DOI]

Iskander Akhmetov

Rustam Mussabayev

Proceedings of the Variable Neighborhood Search - 8th International Conference, 2021

2020

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

[BibT_eX]

[DOI]

J. Sched., 2020

A non-triangular hub location problem.

[BibT_eX]

[DOI]

Optim. Lett., 2020

Preface to the special issue "ICVNS 2018".

[BibT_eX]

[DOI]

Panos M. Pardalos

J. Glob. Optim., 2020

Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines.

[BibT_eX]

[DOI]

J. Glob. Optim., 2020

Revenue maximization of Internet of things provider using variable neighbourhood search.

[BibT_eX]

[DOI]

Vesna Radonjic Dogatovic

Marko Dogatovic

Milorad J. Stanojevic

J. Glob. Optim., 2020

Less is more approach: basic variable neighborhood search for the obnoxious p-median problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2020

Exponential quality function for community detection in complex networks.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2020

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

[BibT_eX]

[DOI]

Inf. Sci., 2020

2019

VNDS for the min-power symmetric connectivity problem.

[BibT_eX]

[DOI]

Roman V. Plotnikov

Adil I. Erzin

Optim. Lett., 2019

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

[BibT_eX]

[DOI]

J. Glob. Optim., 2019

Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2019

Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization.

[BibT_eX]

[DOI]

Dusan Dzamic

Ann. Oper. Res., 2019

Solving the capacitated clustering problem with variable neighborhood search.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2019

Variable Neighborhood Search for a Two-Stage Stochastic Programming Problem with a Quantile Criterion.

[BibT_eX]

[DOI]

Sergey V. Ivanov

Andrey I. Kibzun

Autom. Remote. Control., 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

2018

Variable Neighborhood Search.

[BibT_eX]

[DOI]

Gilberto Farias de Sousa Filho

Proceedings of the Handbook of Heuristics., 2018

Variable Neighborhood Descent.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Heuristics., 2018

Efficient heuristics for the minimum labeling global cut problem.

[BibT_eX]

[DOI]

Thiago Gouveia da Silva

Igor A. M. Barbosa

Lucídio dos Anjos F. Cabral

Luiz Satoru Ochi

Electron. Notes Discret. Math., 2018

On the k-Medoids Model for Semi-supervised Clustering.

[BibT_eX]

[DOI]

Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

Less Is More: The Neighborhood Guided Evolution Strategies Convergence on Some Classic Neighborhood Operators.

[BibT_eX]

[DOI]

Frederico G. Guimarães

Marcone J. F. Souza

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.

[BibT_eX]

[DOI]

Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

2017

NP-Hardness of balanced minimum sum-of-squares clustering.

[BibT_eX]

[DOI]

Artem V. Pyatkin

Pattern Recognit. Lett., 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 computing graph separators.

[BibT_eX]

[DOI]

Jesús Sánchez-Oro

Abraham Duarte

Optim. Lett., 2017

J-means and I-means for minimum sum-of-squares clustering on networks.

[BibT_eX]

[DOI]

Alexey Nikolaev

Optim. Lett., 2017

Preface of special issue BALCOR.

[BibT_eX]

[DOI]

Panos M. Pardalos

Gordana Savic

Optim. Lett., 2017

New MIP model for multiprocessor scheduling problem with communication delays.

[BibT_eX]

[DOI]

Abdessamad Ait El Cadi

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

Special issue on "New trends in Variable Neighborhood Search".

[BibT_eX]

[DOI]

Kenneth Sörensen

Int. Trans. Oper. Res., 2017

Editorial to the Special Cluster on Variable Neighborhood Search, Variants and Recent Applications.

[BibT_eX]

[DOI]

Kenneth Sörensen

Int. Trans. Oper. Res., 2017

Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2017

Comparison of metaheuristics for the k-labeled spanning forest problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2017

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

[BibT_eX]

[DOI]

Leandro Rincon Costa

Inf. Sci., 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

A performance study on multi improvement neighborhood search strategy.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Scheduling preventive railway maintenance activities with resource constraints.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

New VNP for automatic programming.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Clustering approach in maintenance of capillary railway network.

[BibT_eX]

[DOI]

Danijela Doric

Abdessamad Ait El Cadi

Francisco Javier Martín-Campo

Abdelhakim Artiba

Electron. Notes Discret. Math., 2017

A general framework for nested variable neighborhood search.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

On the aircraft conflict resolution problem: A VNS approach in a multiobjective framework.

[BibT_eX]

[DOI]

Antonio Alonso-Ayuso

Laureano F. Escudero

Electron. Notes Discret. Math., 2017

Variable neighborhood search: basics and variants.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2017

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

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

Variable neighborhood search variants for Min-power symmetric connectivity problem.

[BibT_eX]

[DOI]

Adil I. Erzin

Roman V. Plotnikov

Comput. Oper. Res., 2017

Special issue on Variable neighborhood search methods in business and engineering.

[BibT_eX]

[DOI]

Abraham Duarte

Bassem Jarboui

Comput. Oper. Res., 2017

On Strategies to Fix Degenerate k-means Solutions.

[BibT_eX]

[DOI]

Nielsen Castelo Damasceno

Daniel Nobre Pinheiro

J. Classif., 2017

2016

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

[BibT_eX]

[DOI]

Inf. Sci., 2016

Nested general variable neighborhood search for the periodic maintenance problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Luciano Perdigão Cota

Matheus Nohra Haddad

Rodrigo César Pedrosa Silva

Frederico G. Guimarães

Evol. Comput., 2016

An adaptive perturbation-based heuristic: An application to the continuous p-centre problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2016

New local searches for solving the multi-source Weber problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2016

Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks.

[BibT_eX]

[DOI]

Roman V. Plotnikov

Adil I. Erzin

Proceedings of the Discrete Optimization and Operations Research, 2016

Variable Neighborhood Descent for the Capacitated Clustering Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete Optimization and Operations Research, 2016

2015

Fitting censored quantile regression by variable neighborhood search.

[BibT_eX]

[DOI]

J. Glob. Optim., 2015

Multi-objective variable neighborhood search: an application to combinatorial optimization problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2015

Solving the planar p-median problem by variable neighborhood and concentric searches.

[BibT_eX]

[DOI]

J. Glob. Optim., 2015

New heuristic for harmonic means clustering.

[BibT_eX]

[DOI]

Emilio Carrizosa

Abdulrahman Alguwaizani

Francisco Javier Martín-Campo

J. Glob. Optim., 2015

A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes.

[BibT_eX]

[DOI]

Antonio Alonso-Ayuso

Laureano F. Escudero

J. Glob. Optim., 2015

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

[BibT_eX]

[DOI]

Inf. Sci., 2015

Clustering cities based on their development dynamics and Variable neigborhood search.

[BibT_eX]

[DOI]

B. S. Zhikharevich

O. V. Rusetskay

Electron. Notes Discret. Math., 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

BVNS para el problema del bosque generador k-etiquetado.

[BibT_eX]

[DOI]

José M. Valério de Carvalho

CoRR, 2015

Skewed general variable neighborhood search for the location routing scheduling problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

New heuristic algorithms for solving the planar p-median problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

Solving the minimum labelling spanning tree problem by intelligent optimization.

[BibT_eX]

[DOI]

Appl. Soft Comput., 2015

2014

Variable Neighborhood Search for Edge-Ratio Network Clustering.

[BibT_eX]

[DOI]

Sonia Cafieri

Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

A new local search for continuous location problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

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

[BibT_eX]

[DOI]

Kenneth Darby-Dowman

CoRR, 2014

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

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

Editorial.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

A two phase variable neighborhood search for the multi-product inventory routing problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

DE-VNS: Self-adaptive Differential Evolution with crossover neighborhood search for continuous global optimization.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

A variable neighborhood search particle filter for bearings-only target tracking.

[BibT_eX]

[DOI]

Marko S. Djogatovic

Milorad J. Stanojevic

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 minimum sum-of-squares clustering on networks.

[BibT_eX]

[DOI]

Emilio Carrizosa

Eur. J. Oper. Res., 2013

New exact method for large asymmetric distance-constrained vehicle routing problem.

[BibT_eX]

[DOI]

Samira Almoustafa

Eur. J. Oper. Res., 2013

Intelligent variable neighbourhood search for the minimum labelling spanning tree problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Packing unit spheres into the smallest sphere using VNS and NLP.

[BibT_eX]

[DOI]

Rym M'Hallah

Abdulaziz Alkandari

Comput. Oper. Res., 2013

Variable neighborhood search for location routing.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

Sequential clustering with radius and split criteria.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2013

Variable Formulation Search for the Cutwidth Minimization Problem.

[BibT_eX]

[DOI]

Appl. Soft Comput., 2013

Routing of barge container ships by mixed-integer programming heuristics.

[BibT_eX]

[DOI]

Appl. Soft Comput., 2013

Variable neighborhood search for the travelling deliveryman problem.

[BibT_eX]

[DOI]

4OR, 2013

Intelligent Optimization for the Minimum Labelling Spanning Tree Problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

Variable neighborhood search for metric dimension and minimal doubly resolving set problems.

[BibT_eX]

[DOI]

Jozef Kratica

Eur. J. Oper. Res., 2012

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

[BibT_eX]

[DOI]

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

A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem.

[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

Variable neighborhood search for the strong metric dimension problem.

[BibT_eX]

[DOI]

Jozef Kratica

Francisco Javier Martín-Campo

Electron. Notes Discret. Math., 2012

Generating good starting solutions for the p-median problem in the plane.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2012

VNS based algorithm for solving a 0-1 nonlinear nonconvex model for the Collision Avoidance in Air Traffic Management.

[BibT_eX]

[DOI]

Antonio Alonso-Ayuso

Laureano F. Escudero

Electron. Notes Discret. Math., 2012

Variable neighborhood search for the Vertex Separation Problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2012

Gaussian variable neighborhood search for continuous optimization.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2012

2011

A recipe for finding good solutions to MINLPs.

[BibT_eX]

[DOI]

Leo Liberti

Giacomo Nannicini

Math. Program. Comput., 2011

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

[BibT_eX]

[DOI]

IET Commun., 2011

Maximizing edge-ratio is NP-complete.

[BibT_eX]

[DOI]

Steven D. Noble

Discret. Appl. Math., 2011

2010

A Good Recipe for Solving MINLPs.

[BibT_eX]

[DOI]

Leo Liberti

Giacomo Nannicini

Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem.

[BibT_eX]

[DOI]

Kenneth Darby-Dowman

Nat. Comput., 2010

Exact and heuristic solutions of the global supply chain problem with transfer pricing.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 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

Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility.

[BibT_eX]

[DOI]

Jasmina Lazic

Electron. Notes Discret. Math., 2010

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

[BibT_eX]

[DOI]

Comput. Oper. Res., 2010

A variable neighborhood search based algorithm for finite-horizon Markov Decision Processes.

[BibT_eX]

[DOI]

Qiu-Hong Zhao

Appl. Math. Comput., 2010

Attraction probabilities in variable neighborhood search.

[BibT_eX]

[DOI]

4OR, 2010

New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

2009

Variable Neighborhood Search Methods.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Extension of the Weiszfeld procedure to a single facility minisum location model with mixed ℓp norms.

[BibT_eX]

[DOI]

Robert F. Love

Math. Methods Oper. Res., 2009

Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 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

Variable neighbourhood search for the minimum labelling Steiner tree problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2009

2008

Complement to a comparative analysis of heuristics for the p -median problem.

[BibT_eX]

[DOI]

Stat. Comput., 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

General variable neighborhood search for the continuous optimization.

[BibT_eX]

[DOI]

Milan Drazic

Eur. J. Oper. Res., 2008

Variable neighborhood search for minimum cost berth allocation.

[BibT_eX]

[DOI]

Ceyda Oguz

Eur. J. Oper. Res., 2008

Variable neighborhood search.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Variable neighbourhood search: methods and applications.

[BibT_eX]

[DOI]

4OR, 2008

2007

Discrete Particle Swarm Optimization for the Minimum Labelling Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Nature Inspired Cooperative Strategies for Optimization (NICSO 2007), 2007

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

[BibT_eX]

[DOI]

INFORMS J. Comput., 2007

The p-median problem: A survey of metaheuristic approaches.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

Formulation Space Search for Circle Packing Problems.

[BibT_eX]

[DOI]

Frank Plastria

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

Variable Neighborhood Search for the Probabilistic Satisfiability Problem.

[BibT_eX]

[DOI]

Dejan Jovanovic

Zoran Ognjanovic

Proceedings of the Metaheuristics, 2007

2006

A note on duality gap in the simple plant location problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

Variable neighborhood search for the vertex weighted k.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

First vs. best improvement: An empirical study.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Variable neighborhood search and local branching.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2006

2005

Design of balanced MBA student teams.

[BibT_eX]

[DOI]

Jacques Desrosiers

Daniel Villeneuve

J. Oper. Res. Soc., 2005

Reformulation descent applied to circle packing problems.

[BibT_eX]

[DOI]

Frank Plastria

Comput. Oper. Res., 2005

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

[BibT_eX]

[DOI]

J. Classif., 2005

Permutation-Based Genetic, Tabu, and Variable Neighborhood Search Heuristics for Multiprocessor Scheduling with Communication delays.

[BibT_eX]

[DOI]

Tatjana Davidovic

Asia Pac. J. Oper. Res., 2005

Heuristic Procedures for Solving the Discrete Ordered Median Problem.

[BibT_eX]

[DOI]

Patricia Domínguez-Marín

Stefan Nickel

Ann. Oper. Res., 2005

A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem.

[BibT_eX]

[DOI]

Zoran Ognjanovic

Uros Midic

Proceedings of the Hybrid Metaheuristics, Second International Workshop, 2005

2004

Pooling Problem: Alternate Formulations and Solution Methods.

[BibT_eX]

[DOI]

Manag. Sci., 2004

The multi-source Weber problem with constant opening cost.

[BibT_eX]

[DOI]

Saïd Salhi

J. Oper. Res. Soc., 2004

Cooperative Parallel Variable Neighborhood Search for the p-Median.

[BibT_eX]

[DOI]

Teodor Gabriel Crainic

Michel Gendreau

J. Heuristics, 2004

Variable neighborhood search for the maximum clique.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

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

[BibT_eX]

[DOI]

Comput. Oper. Res., 2004

2003

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

[BibT_eX]

[DOI]

Martine Labbé

Networks, 2003

An Oil Pipeline Design Problem.

[BibT_eX]

[DOI]

Oper. Res., 2003

Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.

[BibT_eX]

[DOI]

J. Petrovic

Eur. J. Oper. Res., 2003

Búsqueda de Entorno Variable.

[BibT_eX]

[DOI]

Inteligencia Artif., 2003

2002

Fuzzy J-Means: a new heuristic for fuzzy clustering.

[BibT_eX]

[DOI]

Nabil Belacel

Pattern Recognit., 2002

A note on reduction of quadratic and bilinear programs with equality constraints.

[BibT_eX]

[DOI]

J. Glob. Optim., 2002

2001

J-MEANS: a new local search heuristic for minimum sum of squares clustering.

[BibT_eX]

[DOI]

Pattern Recognit., 2001

Variable Neighborhood Decomposition Search.

[BibT_eX]

[DOI]

Dionisio Pérez-Brito

J. Heuristics, 2001

Variable neighborhood search: Principles and applications.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2001

2000

Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem.

[BibT_eX]

[DOI]

Oper. Res., 2000

1999

An Interior Point Algorithm for Minimum Sum-of-Squares Clustering.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 1999

Degeneracy in the multi-source Weber problem.

[BibT_eX]

[DOI]

Math. Program., 1999

1998

Heuristic solution of the multisource Weber problem as a p-median problem.

[BibT_eX]

[DOI]

Éric D. Taillard

Oper. Res. Lett., 1998

1997

Variable neighborhood search.

[BibT_eX]

[DOI]

Comput. Oper. Res., 1997

1993

How to Choose K Entities Among N.

[BibT_eX]

[DOI]

Brigitte Jaumard