Coarse-Graining Large Search Landscapes Using Massive Edge Collapse

DOI10.1007/978-3-030-43036-8_4zbMath1465.90089OpenAlexW3113373888MaRDI QIDQ5147729

Sebastian Volke, Gerik Scheuermann, Martin Middendorf

Publication date: 28 January 2021

Published in: Mathematics and Visualization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43036-8_4

zbMATH Keywords

combinatorial optimizationfitness landscapestopological analysisbarrier trees

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• QAPLIB
• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• A review of metrics on permutations for search landscape analysis
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• QAPLIB - a quadratic assignment problem library
• TSPLIB—A Traveling Salesman Problem Library
• The landscape of the traveling salesman problem

This page was built for publication: Coarse-Graining Large Search Landscapes Using Massive Edge Collapse