arXiv (All)
open access
Two-Stage Learned Decomposition for Scalable Routing on Multigraphs
Most neural methods for Vehicle Routing Problems (VRPs) are limited to Euclidean settings or simple graphs. In this work, we instead consider multigraphs, where parallel edges represent distinct travel options with varying trade-offs (e.g., distance vs. time). Multigraphs are highly relevant in prac
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- CUNO: Curriculum and Preference Optimization for Stable Graph Unlearning under Mass Deletion#985615
- Oracle-Budgeted Molecular Optimization with Short-Term Graph Memory#414099
- A Storage-Retrieval Gap in Parametric Knowledge Graph Memory#984235
- AIS-Based Vessel Trajectory Prediction Using Memory-Augmented Neural Networks#259524
- Accelerating Branch MPC with Two-Level Parallel Direct Solves on GPUs#1078048
Record · ID 1129240
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive