arXiv (All)
open access
Correcting Connectivity in Arc-Based QUBO Models for Fixed-Fleet Vehicle Routing
We revisit a degree-only arc Hamiltonian for fixed-fleet, homogeneous, uncapacitated vehicle routing. Its local penalties define only a cycle cover, so ground states may contain customer cycles disconnected from the depot. We construct a polynomial-size quadratic unconstrained binary optimization (Q
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
- Network Optimization Aspects of Autonomous Vehicles: Challenges and Future Directions#238547
- Neural Tractability via Structure: Learning-Augmented Algorithms for Graph Combinatorial Optimization#1117280
- Restarted Accelerated Primal-Dual Algorithms with Adaptive Stepsizes for Nonlinear Conic Constrained Convex Optimization#1141554
- A model-based heuristic to the min max K-arc routing for connectivity problem#954456
- Learning Constraints-Based Adaptive Hypergraph Neural Networks for Solving Vehicle Routing Problems#925753
Record · ID 1201043
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