arXiv (All)
open access
Optimal Refinement in Dynamic Discretisation Discovery for Continuous-Time Service Network Design
Dynamic Discretisation Discovery (DDD) is a framework for solving a problem by iteratively solving and refining a relaxed version of the problem. DDD is the basis for state-of-the-art algorithms for various problems, including the continuous-time service network design problem (CTSNDP), which we stu
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
- Extending Exact Integrality Gap Computations for the Metric TSP#986210
- Dynamic Sampling for Telemetry in Microservices: A Reinforcement Learning and Entropy-Based Approach#1108677
- Dynamic Sampling for Telemetry in Microservices: A Reinforcement Learning and Entropy-Based Approach#1105850
- A Finite-Sample Analysis of Quantile Temporal-Difference Learning#1013674
- Process Mining of Patient Flow in an Emergency Department: Bottlenecks, Variant Fragmentation, and Data-Driven Redesign#1115966
Record · ID 1144236
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