The following pages link to The train marshalling problem (Q1570821):
Displaying 21 items.
- On the online track assignment problem (Q423916) (← links)
- How to park freight trains on rail-rail transshipment yards: the train location problem (Q443824) (← links)
- Solving the train marshalling problem by inclusion-exclusion (Q516904) (← links)
- Shunting minimal rail car allocation (Q812422) (← links)
- The complexity of Snake and undirected NCL variants (Q1623271) (← links)
- An integrated model for the transshipment yard scheduling problem (Q1707671) (← links)
- Inglenook shunting puzzles (Q1740366) (← links)
- Study on the stochastic chance-constrained fuzzy programming model and algorithm for wagon flow scheduling in railway bureau (Q1954981) (← links)
- Minimizing delays in a shunting yard (Q2018111) (← links)
- Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms (Q2284641) (← links)
- On the hardness of palletizing bins using FIFO queues (Q2330097) (← links)
- New bounds and algorithms for the transshipment yard scheduling problem (Q2434300) (← links)
- Track assignment (Q2457297) (← links)
- Distances of centroid sets in a graph-based construction for information security applications (Q2516494) (← links)
- On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
- Multistage methods for freight train classification (Q3076019) (← links)
- FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC (Q3503068) (← links)
- Ideal basis in constructions defined by directed graphs (Q5006551) (← links)
- Solving Sorting of Rolling Stock Problems Utilizing Pseudochain Structures in Graphs (Q5051120) (← links)
- (Q5240128) (← links)
- The basic train makeup problem in shunting yards (Q5964852) (← links)
