Pages that link to "Item:Q2638371"
From MaRDI portal
The following pages link to Solving a real-world train-unit assignment problem (Q2638371):
Displaying 15 items.
- Local convex hulls for a special class of integer multicommodity flow problems (Q301702) (← links)
- An algorithm for self-organization of driverless vehicles of a car-rental service (Q332734) (← links)
- Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem (Q1674899) (← links)
- Optimization methods for the train unit shunting problem (Q1683138) (← links)
- A tree-based model for setting optimal train fare zones (Q1718240) (← links)
- Redundant coupling/decoupling in train unit scheduling optimization (Q1742197) (← links)
- A branch and bound algorithm for the exact solution of the problem of EMU circulation scheduling in railway network (Q1793684) (← links)
- Integrated optimization of train formation plan and rolling stock scheduling under time-dependent demand (Q2108146) (← links)
- The problem of trains formation and scheduling: integer statements (Q2441252) (← links)
- A Lagrangian heuristic for a train-unit assignment problem (Q2446297) (← links)
- The Train Delivery Problem Revisited (Q2872124) (← links)
- 04. Solution of the train platforming problem (Q2917365) (← links)
- Solving a real-world train unit assignment problem (Q2917370) (← links)
- Avoiding unnecessary demerging and remerging of multi‐commodity integer flows (Q6092659) (← links)
- Freight railcar-to-train assignment and departure scheduling in a railyard (Q6556092) (← links)
