Hill Climbing with Multiple Local Optima
From MaRDI portal
Publication:3690218
DOI10.1137/0606040zbMath0572.68031OpenAlexW2010632883MaRDI 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 problemsclique problemaverage performance of algorithmsbehavior of local improvement algorithms
Related Items
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?, On the number of iterations of local improvement algorithms, Recognition problems for special classes of polynomials in 0-1 variables, A new extension of local search applied to the Dial-A-Ride problem, On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming, Accelerated branch exchange heuristics for symmetric traveling salesman problems, An analysis of neighborhood functions on generic solution spaces, Pseudo-Boolean optimization, Data-independent neighborhood functions and strict local optima, Mechanisms for local search, Low order polynomial bounds on the expected performance of local improvement algorithms, A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM, An empirical study of a new metaheuristic for the traveling salesman problem, Order preserving reductions and polynomial improving paths, Construction of skolem sequences
Cites Work
