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.
Matrix encoding networks for neural combinatorial optimization.Advances in Neural Information Processing Systems, 34:5138–5149
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.AI 2years
2026 2verdicts
UNVERDICTED 2roles
baseline 1polarities
baseline 1representative citing papers
The CARM module boosts neural routing solvers by adaptively modulating embeddings with constraint variables, enabling better use of global observations and improved performance on constrained VRPs.
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.
-
Rethinking Constraint Awareness for Efficient State Embedding of Neural Routing Solver
The CARM module boosts neural routing solvers by adaptively modulating embeddings with constraint variables, enabling better use of global observations and improved performance on constrained VRPs.