Efficiency of local search with multiple local optima

DOI10.1137/S0895480199355225MaRDI QIDQ2784507zbMATH OpenOpenAlexFDO

Authors Leila Kallel, Josselin Garnier

Publication date 23 April 2002

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480199355225

zbMATH Keywords

combinatorial complexitylocal searchneighborhood graphrandomized starting solution

Mathematics Subject Classification ID

Limit theorems in probability theory (60F99) Searching and sorting (68P10) Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 1664963
• Statistical analysis of local search landscapes
• Estimating the number of basins of attraction of multi-objective combinatorial problems
• Mechanisms for local search
• Landscapes, operators and heuristic search

Cited in

(32)

• Stochastic protein folding simulation in the three-dimensional HP-model
• A multi-local optimization algorithm
• Landscapes, operators and heuristic search
• A new adaptive multi-start technique for combinatorial global optimizations
• Steepest ascent can be exponential in bounded treewidth problems
• The component model for elementary landscapes and partial neighborhoods
• On the fractal nature of local optima networks
• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
• Estimating the number of basins of attraction of multi-objective combinatorial problems
• scientific article; zbMATH DE number 1617353 (Why is no real title available?)
• scientific article; zbMATH DE number 1664963 (Why is no real title available?)
• Direct statistical estimation of GA landscape properties
• Why operator-induced neighborhoods are a bad idea
• Efficient multi-start strategies for local search algorithms
• Characterizing local optima for maximum parsimony
• Hill Climbing with Multiple Local Optima
• scientific article; zbMATH DE number 1961992 (Why is no real title available?)
• scientific article; zbMATH DE number 2079886 (Why is no real title available?)
• AN OPTIMAL DISTRIBUTION OF SEARCHING EFFORT RELAXING THE ASSUMPTION OF LOCAL EFFECTIVENESS
• Why locating local optima is sometimes more complicated than locating global ones
• On confidence intervals for the number of local optima
• A complex-networks view of hard combinatorial search spaces
• Markov chain modelling of the solution surface in local search
• Statistical analysis of local search landscapes
• Representing fitness landscapes by valued constraints to understand the complexity of local search
• How perturbation strength shapes the global structure of TSP fitness landscapes
• Efficiency of Local Search
• The fractal geometry of fitness landscapes at the local optima level
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
• Analysis of local search landscapes for \(k\)-SAT instances
• Generating QAP instances with known optimum solution and additively decomposable cost function
• Attraction probabilities in variable neighborhood search

This page was built for publication: Efficiency of local search with multiple local optima

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784507)