Complexity, bounds and dynamic programming algorithms for single track train scheduling (Q1730675)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity, bounds and dynamic programming algorithms for single track train scheduling |
scientific article; zbMATH DE number 7032670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity, bounds and dynamic programming algorithms for single track train scheduling |
scientific article; zbMATH DE number 7032670 |
Statements
Complexity, bounds and dynamic programming algorithms for single track train scheduling (English)
0 references
6 March 2019
0 references
machine scheduling
0 references
train scheduling
0 references
complexity analysis
0 references
counter routes
0 references
dynamic programming
0 references
0.9154365
0 references
0.9128947
0 references
0.90820193
0 references
0.89400744
0 references
0.8925519
0 references
0.8920812
0 references
0.88977575
0 references
0.88861275
0 references
