A branch and bound algorithm for scheduling trains in a railway network (Q2371354)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5169667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for scheduling trains in a railway network |
scientific article; zbMATH DE number 5169667 |
Statements
A branch and bound algorithm for scheduling trains in a railway network (English)
0 references
4 July 2007
0 references
train scheduling
0 references
real-time conflict resolution
0 references
alternative graph
0 references
branch and bound algorithm
0 references
0.8060834407806396
0 references
0.8019433617591858
0 references
0.79884934425354
0 references
