Optimal Algorithms for Train Shunting and Relaxed List Update Problems.
From MaRDI portal
Publication:2918966
DOI10.4230/OASIcs.ATMOS.2012.97zbMath1247.90059OpenAlexW2292601221MaRDI QIDQ2918966
Publication date: 2 October 2012
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3706/
Analysis of algorithms (68W40) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (1)
This page was built for publication: Optimal Algorithms for Train Shunting and Relaxed List Update Problems.