Mechanisms for local search

DOI10.1016/0377-2217(94)00164-2zbMath0913.90227OpenAlexW2077744691MaRDI QIDQ1266572

Edward J. Anderson

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00164-2

zbMATH Keywords

quadratic assignmenttravelling salesman problemlocal search methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

A survey for the quadratic assignment problem ⋮ Some computational issues in cluster analysis with no a priori metric ⋮ A computational study of several relocation methods for \(k\)-means algorithms.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• Efficient simulated annealing on fractal energy landscapes
• Structural analysis of local search heuristics in combinatorial optimization
• A new approach to choosing initial points in local search
• A probabilistic analysis of the switching algorithm for the Euclidean TSP
• Eigenvalues, diameter, and mean distance in graphs
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Hill Climbing with Multiple Local Optima
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Mechanisms for local search