Pages that link to "Item:Q2847382"
From MaRDI portal
The following pages link to A graph theoretical approach to the shunting problem (Q2847382):
Displaying 16 items.
- On the online track assignment problem (Q423916) (← links)
- Formation of train routes in a station (Q904458) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- On minimum \(k\)-modal partitions of permutations (Q1018088) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- Shunting operations at flat yards: retrieving freight railcars from storage tracks (Q1656426) (← links)
- Inglenook shunting puzzles (Q1740366) (← links)
- Integrating rolling stock scheduling with train unit shunting (Q1751830) (← links)
- Distance-hereditary comparability graphs (Q1759843) (← links)
- Track assignment (Q2457297) (← links)
- Distance-hereditary comparability graphs (Q2840542) (← links)
- Using graph theory for automated electric circuit solving (Q3454647) (← links)
- Online Bounded Coloring of Permutation and Overlap Graphs (Q3503553) (← 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)