Handouts for ME391Q - Heuristic Search Methods in Mathematical Optimization (continued)
Group Theory and Metaheuristic Search Neighborhoods ---------------------------------------------------Group Theory and Transition Matrices for Conjugative Move Disciplines in Multiple TSP's with
Known Solution Structure ----------------------------------------------------------------------------------------Using Group Theory to Efficiently Compute Move Values for Routing Problems ---------------------Linearity in the Traveling Salesman Problem -----------------------------------------------------------------Local Search Structure in the Symmetric Traveling Salesperson Problem Under a General Class of
Rearrangement Neighborhoods ----------------------------------------------------------------------------------
630
658
680
688
694