Applying topological data analysis to local search problems

DOI10.3934/fods.2022006OpenAlexW4214926509MaRDI QIDQ6154230

Erik Carlsson, John Gunnar Carlsson, Shannon Sweitzer

Publication date: 14 February 2024

Published in: Foundations of Data Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/fods.2022006

zbMATH Keywords

Markov chainscombinatorial optimizationtraveling salesmanlocal searchpersistent homology

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Combinatorial optimization (90C27) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Tabu search applied to global optimization
• Discrete Green's functions
• Guided local search and its application to the traveling salesman problem
• On configuration spaces, their homology, and Lie algebras
• Lipschitz continuity for isotropic matrix functions
• A guided local search metaheuristic for the team orienteering problem
• Iterated local search for the quadratic assignment problem
• javaPlex: A Research Software Package for Persistent (Co)Homology
• Improving homology estimates with random walks
• TSPLIB—A Traveling Salesman Problem Library
• Global optimization using special ordered sets
• Big Data Optimization: Recent Developments and Challenges
• Handbook of metaheuristics

This page was built for publication: Applying topological data analysis to local search problems