Routing trains through a railway station based on a node packing model
From MaRDI portal
Recommendations
Cites work
- A Mathematical Model for Periodic Scheduling Problems
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- scientific article; zbMATH DE number 956849 (Why is no real title available?)
- On the facial structure of set packing polyhedra
- Routing trains through railway stations: Complexity issues
- Routing Trains Through Railway Stations: Model Formulation and Algorithms
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
Cited in
(23)- Design of a railway scheduling model for dense services
- Routing trains through railway stations: Complexity issues
- Routing of railway carriages
- A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm
- Safe dike heights at minimal costs: an integer programming approach
- Measuring the accessibility of railway stations in the Brussels regional express network: a node-place modeling approach
- Dynamic node packing
- Graph coloring-based approach for railway station design analysis and capacity determination
- Improving the robustness in railway station areas
- A sequencing approach for creating new train timetables
- Stability evaluation of a railway timetable at station level
- A disjunctive graph model and framework for constructing new train schedules
- Real time management of a metro rail terminus
- A fast approximation algorithm for solving the complete set packing problem
- On solving multi-type railway line planning problems
- A set packing inspired method for real-time junction train routing
- Routing Trains Through Railway Stations: Model Formulation and Algorithms
- An adaptive memory programming method for risk logistics operations
- Review of real-time vehicle schedule recovery methods in transportation services
- Railway track allocation: Models and methods
- Solving a multi-resolution model of the train platforming problem using Lagrangian relaxation with dynamic multiplier aggregation
- Solving the set packing problem via a maximum weighted independent set heuristic
- Formation of train routes in a station
This page was built for publication: Routing trains through a railway station based on a node packing model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1592731)
