A MIP-based local search method for the railway rescheduling problem (Q3076018)
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: A MIP-based local search method for the railway rescheduling problem |
scientific article; zbMATH DE number 5852397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A MIP-based local search method for the railway rescheduling problem |
scientific article; zbMATH DE number 5852397 |
Statements
A MIP-based local search method for the railway rescheduling problem (English)
0 references
17 February 2011
0 references
disruption management
0 references
rescheduling
0 references
train timetabling
0 references
local branching
0 references
0.8402518033981323
0 references
0.8125371932983398
0 references
0.7980819940567017
0 references
0.7921753525733948
0 references
0.7886952757835388
0 references
