olving combinatorial optimization problems efficiently requires the development of algorithms that consider the specific properties of the problems. In this sense, local search algorithms are designed over a neighborhood structure that partially accounts for these properties. Considering a neighborhood, the space is usually interpreted as a natural landscape, with valleys and mountains. Under this perception, it is commonly believed that, if maximizing, the solutions located in the slopes of the same mountain belong to the same attraction basin, with the peaks of the mountains being the local optima. Unfortunately, this is a widespread erroneous visualization of a combinatorial landscape. Thus, our aim is to clarify this aspect, providing a...
This is the author accepted manuscript. The final version is available from ACM via the DOI in this ...
Les problèmes d'optimisation combinatoire sont généralement NP-difficiles et les méthodes exactes de...
Local Optima Networks are models proposed to understand the structure and properties of combinatoria...
Combinatorial optimization involves finding an optimal solution in a finite set of options; many eve...
International audienceThis paper extends a recently proposed model for combinatorial landscapes: Loc...
best paper nominationInternational audienceWe propose a network characterization of combinatorial fi...
The big valley hypothesis suggests that, in combinatorial optimisation, local optima of good quality...
International audienceWe propose a network characterization of combinatorial fitness landscapes by a...
Abstract. This paper extends a recently proposed model for combinatorial land-scapes: Local Optima N...
The performance of local search algorithms is influenced by the properties that the neighborhood imp...
This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LO...
The existence of sub-optimal funnels in combinatorial fitness landscapes has been linked to search d...
Abstract. This chapter overviews a recently introduced network-based model of combinatorial landscap...
The global structure of travelling salesman's fitness landscapes has recently revealed the presence ...
In a series of papers we introduced a novel model for combinatorial landscapes that we called Local ...
This is the author accepted manuscript. The final version is available from ACM via the DOI in this ...
Les problèmes d'optimisation combinatoire sont généralement NP-difficiles et les méthodes exactes de...
Local Optima Networks are models proposed to understand the structure and properties of combinatoria...
Combinatorial optimization involves finding an optimal solution in a finite set of options; many eve...
International audienceThis paper extends a recently proposed model for combinatorial landscapes: Loc...
best paper nominationInternational audienceWe propose a network characterization of combinatorial fi...
The big valley hypothesis suggests that, in combinatorial optimisation, local optima of good quality...
International audienceWe propose a network characterization of combinatorial fitness landscapes by a...
Abstract. This paper extends a recently proposed model for combinatorial land-scapes: Local Optima N...
The performance of local search algorithms is influenced by the properties that the neighborhood imp...
This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LO...
The existence of sub-optimal funnels in combinatorial fitness landscapes has been linked to search d...
Abstract. This chapter overviews a recently introduced network-based model of combinatorial landscap...
The global structure of travelling salesman's fitness landscapes has recently revealed the presence ...
In a series of papers we introduced a novel model for combinatorial landscapes that we called Local ...
This is the author accepted manuscript. The final version is available from ACM via the DOI in this ...
Les problèmes d'optimisation combinatoire sont généralement NP-difficiles et les méthodes exactes de...
Local Optima Networks are models proposed to understand the structure and properties of combinatoria...