DyNACO uses periodic observation of pheromone and incumbent solution for dynamic neural guidance in large-scale ACO, improving TSP and CVRP solvers with low overhead.
Cryptology ePrint Archive, Paper 2018/244, URL https://eprint.iacr.org/2018/244 Heinrich K, Hell P (1987) On the problems of bandsize
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
Reordering sparse matrices packs nonzeros into fewer diagonals, achieving average 5.5x reduction in diagonal count and up to 45.6x for some matrices in homomorphic encryption settings.
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.
citing papers explorer
-
Beyond Static Priors: Dynamic Neural Guidance for Large-Scale Ant Colony Optimization
DyNACO uses periodic observation of pheromone and incumbent solution for dynamic neural guidance in large-scale ACO, improving TSP and CVRP solvers with low overhead.
-
Packing Entries to Diagonals for Homomorphic Sparse-Matrix Vector Multiplication
Reordering sparse matrices packs nonzeros into fewer diagonals, achieving average 5.5x reduction in diagonal count and up to 45.6x for some matrices in homomorphic encryption settings.
-
A Hybrid Classical-Quantum Annealing Algorithm for the TSP
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.