A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014

DOI10.1007/s10479-017-2543-yzbMath1434.90062OpenAlexW2621849017MaRDI QIDQ1730606

Hugo Joudrier, Florence Thiard

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2543-y

zbMATH Keywords

schedulinggreedy algorithmmulti-interval constraint propagationrailway stock management

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Uses Software

• Haskell
• filib++
• IBEX
• Algorithm 97

Cites Work

• Unnamed Item
• Contractor programming
• PROFIL/BIAS - A fast interval library
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• Global Optimization Based on Contractor Programming: An Overview of the IBEX Library
• Aggregation and Disaggregation Techniques and Methodology in Optimization
• FILIB++, a fast interval library supporting containment computations

This page was built for publication: A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014