Digital Commons @ Michigan Tech
metadata only
Optimal Solutions for the Moving Target Vehicle Routing Problem via Branch-and-Price with Relaxed Continuity
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
- New algorithmic methods for real-time transportation problems#454317
- Network Optimization Aspects of Autonomous Vehicles: Challenges and Future Directions#238547
- Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets#480082
- Geometric flows of branched transportation networks#1050627
- Fair and Efficient Investment in Public Transportation#1156272
Record · ID 387397
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