Optimal Refinement in Dynamic Discretisation Discovery for Continuous-Time Service Network Design HS4X20TX33
| URI | m2://res/HS4X20TX33 |
|---|---|
| Kind | preprint |
| Creators | Alexander Helber, Oliver Bachtler, Tom Wüllner |
| Date | 2026-09-30 |
| MSC | 49-XX, 90-XX, 93-XX |
| Subjects | arxiv math.OC |
| Scope | in |
Expressions
e1: version, preprint
| Language | en |
|---|---|
| Date | 2026-09-30 |
| Ids | arXiv 2609.39269 |
Items in this resource
The mentions of the inventory that name this resource. Each name links to the card of its inventory row.
| Item | Kind | Where | Source |
|---|---|---|---|
| Time-expanded too-long path graph | definition | definition 0.28 | arxiv |
| 2DRTQG4H0C | statement | lemma 0.4 | arxiv |
| Significant time points | statement | theorem 0.47 | arxiv |
| 6JE372N8PK | example | example 0.18 | arxiv |
| 6V23V6AWXA | statement | fact 0.11 | arxiv |
| 7F0RQCAEBR | statement | theorem 0.26 | arxiv |
| 89SSBJ9B78 | statement | fact 0.39 | arxiv |
| 8ZSSMPSBPV | statement | fact 0.21 | arxiv |
| 9XSBNSYDSJ | definition | definition 0.10 | arxiv |
| AFCFTH5FEV | statement | fact 0.23 | arxiv |
| Earliest and latest dispatch times | definition | definition 0.1 | arxiv |
| CV0H9NV4T5 | example | example 0.38 | arxiv |
| E0ZXRGK74H | statement | lemma 0.40 | arxiv |
| E542WJVESJ | statement | fact 0.2 | arxiv |
| FVW9EWWC40 | statement | theorem 0.37 | arxiv |
| G5ZMFA53Q3 | statement | corollary 0.36 | arxiv |
| GGWHQCWGAD | definition | definition 0.42 | arxiv |
| \calT-Relaxed) too-long$^*$ paths | definition | definition 0.45 | arxiv |
| HBVFTDRX3P | statement | fact 0.6 | arxiv |
| KX5JW7C0VH | statement | theorem 0.16 | arxiv |
| KXV25WECCX | statement | fact 0.30 | arxiv |
| MVQYM259XP | statement | theorem 0.33 | arxiv |
| MX68TMKPZ1 | statement | lemma 0.44 | arxiv |
| Real arrival time and too-long paths | definition | definition 0.7 | arxiv |
| PNXST5KYJ6 | statement | corollary 0.13 | arxiv |
| R6CZCBB2R6 | statement | theorem 0.9 | arxiv |
| RA9Z5KQH79 | statement | lemma 0.22 | arxiv |
| RHZ2EBE577 | definition | definition 0.29 | arxiv |
| Minimal too-long path | definition | definition 0.12 | arxiv |
| Candidate graph | statement | lemma 0.35 | arxiv |
| SR5Q45B0WR | statement | fact 0.17 | arxiv |
| SZHJQPRFTZ | statement | theorem 0.43 | arxiv |
| TBYH4S9D82 | definition | definition 0.3 | arxiv |
| Slack consumption and lateness | definition | definition 0.20 | arxiv |
| Relaxed arrival times in {{$\exgraph$ | definition | definition 0.32 | arxiv |
| VX6ADATHYF | statement | corollary 0.31 | arxiv |
| Relaxed arrival times and relaxed too-long paths | definition | definition 0.14 | arxiv |
| W8YJ42PQ10 | example | example 0.46 | arxiv |
| Partition-linking graph | definition | definition 0.41 | arxiv |
| Dispatch-node graph | definition | definition 0.5 | arxiv |
| XPMAT03KCP | example | example 0.27 | arxiv |
| XQ05MWJSRN | statement | lemma 0.24 | arxiv |
Catalogue records
- arxiv: 2609.39269 (work)
- arxiv_text: 2609.39269 (work)