Hill Climbing with Multiple Local Optima
From MaRDI portal
Publication:3690218
DOI10.1137/0606040zbMath0572.68031MaRDI QIDQ3690218
Publication date: 1985
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0606040
combinatorial optimization problems; clique problem; average performance of algorithms; behavior of local improvement algorithms
Related Items
Low order polynomial bounds on the expected performance of local improvement algorithms, On the number of iterations of local improvement algorithms, Pseudo-Boolean optimization, Recognition problems for special classes of polynomials in 0-1 variables, Mechanisms for local search, An empirical study of a new metaheuristic for the traveling salesman problem, A new extension of local search applied to the Dial-A-Ride problem, Data-independent neighborhood functions and strict local optima, Polynomial transformations and data-independent neighborhood functions, Extending shelling orders and a hierarchy of functions of unimodal simple polytopes, How difficult is the frequency selection problem?, An analysis of neighborhood functions on generic solution spaces, Order preserving reductions and polynomial improving paths, Accelerated branch exchange heuristics for symmetric traveling salesman problems, Construction of skolem sequences
Cites Work
