Optimal control on a graph with application to train scheduling problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 446516 (Why is no real title available?)
- scientific article; zbMATH DE number 3934807 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- A Class of Continuous Network Flow Problems
- Control parametrization: a unified approach to optimal control problems with general constraints
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Railway scheduling by network optimization
Cited in
(4)- A Combinatorial, Graph-Based Solution Method for a Class of Continuous-Time Optimal Control Problems
- scientific article; zbMATH DE number 1905100 (Why is no real title available?)
- scientific article; zbMATH DE number 446516 (Why is no real title available?)
- A fast heuristic for the train scheduling problem
This page was built for publication: Optimal control on a graph with application to train scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753655)