arXiv (All)
open access
Optimal Service Commitments in Traveling Salesman Problems with Stochastic Demand
In ridepooling services, mobility providers must communicate an expected arrival time before customers decide whether to book. An ambitious commitment attracts higher demand than a conservative one, but is correspondingly harder to fulfill. Provider revenue is therefore governed by an endogenous int
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
- Constrained optimal transport with applications to large matching markets#609898
- A $(1+1/\sqrt{2})$-Approximation for the Multiple-Depot Traveling Salesman Problem#1014130
- A Robustified Greedy Algorithm for Online Transportation with Improved Competitive Guarantees#1144019
- InfoOT: Information Maximizing Optimal Transport#643861
- Empirical Comparsion of Traveling Salesperson Approximation Algorithms#332996
Record · ID 999934
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