Coarse-Graining Large Search Landscapes Using Massive Edge Collapse
From MaRDI portal
Recommendations
- FINDING MINIMA IN COMPLEX LANDSCAPES: ANNEALED, GREEDY AND RELUCTANT ALGORITHMS
- Coarse-grained parallel geometric search
- Pipelined search on coarse grained networks
- Large scale evolutionary optimization using cooperative coevolution
- scientific article; zbMATH DE number 2151246
- Coalescent simulation in continuous space: algorithms for large neighbourhood size
- Coarse-grid selection using simulated annealing
- Constraint-based very large-scale neighborhood search
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1488085 (Why is no real title available?)
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- A review of metrics on permutations for search landscape analysis
- QAPLIB - a quadratic assignment problem library
- TSPLIB—A Traveling Salesman Problem Library
- The landscape of the traveling salesman problem
Cited in
(3)
This page was built for publication: Coarse-Graining Large Search Landscapes Using Massive Edge Collapse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147729)