#### Filter Results:

- Full text PDF available (62)

#### Publication Year

1993

2017

- This year (27)
- Last 5 years (79)
- Last 10 years (116)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Pierre Hansen, Nenad Mladenovic
- European Journal of Operational Research
- 2001

Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and eective metaheuristic for combinatorial and global optimization, called variable neighborhood search (VNS). We present a basic scheme for this purpose, which can easily be implemented using any local search algorithm as a subroutine. Its eectiveness… (More)

- Pierre Hansen, Nenad Mladenovic, Dionisio Pérez-Brito
- J. Heuristics
- 2001

The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from local optimum phases. When solving large instances of various problems, its efficiency may be enhanced through decomposition. The resulting two level VNS, called Variable Neighborhood Decomposition Search… (More)

- Nenad Mladenovic, Dragan Urosevic, Dionisio Pérez-Brito, Carlos G. García-González
- European Journal of Operational Research
- 2010

The problem of reducing the bandwidth of a matrix consists of finding a permutation of rows and columns of a given matrix which keeps the non-zero elements in a band as close as possible to the main diagonal. This NP-complete problem can also be formulated as a vertex labelling problem on a graph, where each edge represents a non-zero element of the matrix.… (More)

- Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
- European Journal of Operational Research
- 1997

Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications are briefly summarized. They comprise heuristic solution of… (More)

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley. It was first proposed in 1997 and has since then rapidly developed both in its methods and its… (More)

- Pierre Hansen, Nenad Mladenovic
- Pattern Recognition
- 2001

A new local search heuristic, called J-Means, is proposed for solving the minimum sum-of-squares clustering problem. The neighborhood of the current solution is deened by all possible centroid-to-entity relocations followed by corresponding changes of assignments. Moves are made in such neighborhoods until a local optimum is reached. The new heuristic is… (More)

Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood change, both in the descent to local minima and in the escape from the valleys which contain them. In this tutorial we first present the ingredients of VNS, i.e., Variable Neighborhood Descent (VND) and… (More)

- Charles Audet, Jack Brimberg, Pierre Hansen, Sébastien Le Digabel, Nenad Mladenovic
- Management Science
- 2004

T pooling problem, which is fundamental to the petroleum industry, describes a situation in which products possessing different attribute qualities are mixed in a series of pools in such a way that the attribute qualities of the blended products of the end pools must satisfy given requirements. It is well known that the pooling problem can be modeled… (More)

- Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
- Discrete Applied Mathematics
- 2004

Maximum clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic variable neighborhood search heuristic for maximum clique that combines greedy with the simplicial vertex test in its descent step is proposed and tested on standard test problems from the literature. Despite its… (More)

- Teodor Gabriel Crainic, Michel Gendreau, Pierre Hansen, Nenad Mladenovic
- J. Heuristics
- 2004