arXiv (All)
open access
Approximating Unsplittable Capacitated Vehicle Routing: Analysis via Factor-Revealing LPs
The capacitated vehicle routing problem (CVRP) is one of the most extensively studied problems in combinatorial optimization. Given a depot and a set of customers with demands in a metric space, the objective is to find a set of tours, each starting and ending at the depot, operated by a capacitated
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
- Large Language Model Assisted Transportation Planning through a Differentiable User Equilibrium Layer#1327730
- Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets#480082
- Correcting Connectivity in Arc-Based QUBO Models for Fixed-Fleet Vehicle Routing#1201043
- LLM-Driven Joint Evolution of Coupled Heuristics Components for Routing Optimization#924242
- LLM-Driven Joint Evolution of Coupled Heuristics Components for Routing Optimization#920011
Record · ID 1344497
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