The train marshalling problem
From MaRDI portal
Publication:1570821
DOI10.1016/S0166-218X(99)00219-XzbMath0962.90009MaRDI QIDQ1570821
Mirka Miller, Elias Dahlhaus, Joseph F. Ryan, Peter Horák
Publication date: 21 June 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Hypergraphs (05C65) Traffic problems in operations research (90B20)
Related Items (21)
The complexity of Snake and undirected NCL variants ⋮ Solving Sorting of Rolling Stock Problems Utilizing Pseudochain Structures in Graphs ⋮ Unnamed Item ⋮ FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC ⋮ On the online track assignment problem ⋮ New bounds and algorithms for the transshipment yard scheduling problem ⋮ An integrated model for the transshipment yard scheduling problem ⋮ How to park freight trains on rail-rail transshipment yards: the train location problem ⋮ Study on the stochastic chance-constrained fuzzy programming model and algorithm for wagon flow scheduling in railway bureau ⋮ Track assignment ⋮ Inglenook shunting puzzles ⋮ Solving the train marshalling problem by inclusion-exclusion ⋮ Minimizing delays in a shunting yard ⋮ On the complexity of distributed graph coloring with local minimality constraints ⋮ Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms ⋮ The basic train makeup problem in shunting yards ⋮ Distances of centroid sets in a graph-based construction for information security applications ⋮ Multistage methods for freight train classification ⋮ On the hardness of palletizing bins using FIFO queues ⋮ Ideal basis in constructions defined by directed graphs ⋮ Shunting minimal rail car allocation
Cites Work
This page was built for publication: The train marshalling problem
