Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficiency of Local Search with Multiple Local Optima

From MaRDI portal
Publication:2784507
Jump to:navigation, search

DOI10.1137/S0895480199355225zbMath0992.68039OpenAlexW2061494390MaRDI QIDQ2784507

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

local searchneighborhood graphcombinatorial complexityrandomized starting solution


Mathematics Subject Classification ID

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


Related Items (8)

Characterizing local optima for maximum parsimony ⋮ Generating QAP instances with known optimum solution and additively decomposable cost function ⋮ Estimating the number of basins of attraction of multi-objective combinatorial problems ⋮ Analysis of local search landscapes for \(k\)-SAT instances ⋮ Features for the 0-1 knapsack problem based on inclusionwise maximal solutions ⋮ A Complex-Networks View of Hard Combinatorial Search Spaces ⋮ Attraction probabilities in variable neighborhood search ⋮ Stochastic protein folding simulation in the three-dimensional HP-model




This page was built for publication: Efficiency of Local Search with Multiple Local Optima

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2784507&oldid=15674750"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 17:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki