Compares Composition and Hypergraph models for rolling stock scheduling, proves equal LP bounds for sufficiently expressive Hypergraph variants, and shows Composition model is more compact with faster optimal solutions on NS instances.
7th International Conference on railway operations modelling and Analysis (RailLille 2017), 688--698, ://nbn-resolving.org/urn:nbn:de:0297-zib-63930
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Comparison of Models for Rolling Stock Scheduling
Compares Composition and Hypergraph models for rolling stock scheduling, proves equal LP bounds for sufficiently expressive Hypergraph variants, and shows Composition model is more compact with faster optimal solutions on NS instances.