arXiv (OAI Expanded)
open access
Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
The multiple-depot split delivery vehicle routing problem is a challenging optimization problem with broad applications in logistics and transportation. The goal is to serve customers' demand using a limited fleet of capacitated vehicles stationed at multiple depots, allowing each customer's demand
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
- Exact and heuristic approaches for the integrated block relocation and fleet allocation problem with soft precedence constraints#330348
- Expected Hypervolume Maximization for Multiobjective Optimization under Uncertainties#1014905
- Combined Modality Treatment for Patients With Stage IV Melanoma#835971
- Simple Hierarchical Planning with Diffusion#436424
- Netload Range Cost Curves for Coordinated Transmission-Distribution Planning Under DER Growth Uncertainty#624374
Record · ID 1122998
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