On the number of iterations of local improvement algorithms

DOI10.1016/0167-6377(83)90030-5zbMath0526.65045OpenAlexW2073430829MaRDI QIDQ594546

Craig A. Tovey

Publication date: 1983

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(83)90030-5

zbMATH Keywords

combinatorial optimizationcomplementarityaverage performancelocal improvement

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Convergence of an annealing algorithm, A probabilistic analysis of the switching algorithm for the Euclidean TSP, Low order polynomial bounds on the expected performance of local improvement algorithms, The effectiveness of finite improvement algorithms for finding global optima, Hill Climbing with Multiple Local Optima

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Observations on a class of nasty linear complementarity problems
• Complementary pivot theory of mathematical programming
• Hill Climbing with Multiple Local Optima
• Computational complexity of LCPs associated with positive definite symmetric matrices
• Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
• Convex Location Problems on Tree Networks
• On the Complexity of Local Search for the Traveling Salesman Problem
• Some Examples of Difficult Traveling Salesman Problems
• Computer Solutions of the Traveling Salesman Problem
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior