The paper introduces the Compositional Geometry Routing Problem and proposes DiCon, a differential-attention plus double-level contrastive learning solver that reports strong performance and generalization on mixed-geometry routing instances.
Lin–Kernighan heuristic adaptations for the generalized traveling salesman problem.European Journal of Operational Research, 208(3):221–232, 2011
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Learning to Solve Compositional Geometry Routing Problems
The paper introduces the Compositional Geometry Routing Problem and proposes DiCon, a differential-attention plus double-level contrastive learning solver that reports strong performance and generalization on mixed-geometry routing instances.