Optimal control on a graph with application to train scheduling problems

DOI10.1016/0895-7177(91)90115-NzbMATH Open0716.90034OpenAlexW2006428415MaRDI QIDQ753655FDOQ753655

Authors: C. J. Goh, Alistair Mees 

Publication date: 1991

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(91)90115-n

Recommendations

• scientific article; zbMATH DE number 446516
• Publication:4864971
• A Combinatorial, Graph-Based Solution Method for a Class of Continuous-Time Optimal Control Problems
• scientific article; zbMATH DE number 1905100
• scientific article; zbMATH DE number 33715

zbMATH Keywords

network optimizationlarge scale systemstrain scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Application models in control theory (93C95)

Cites Work

• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Railway scheduling by network optimization
• Title not available (Why is that?)
• Control parametrization: a unified approach to optimal control problems with general constraints
• Title not available (Why is that?)
• A Class of Continuous Network Flow Problems
• Title not available (Why is that?)

Cited In (4)

• A Combinatorial, Graph-Based Solution Method for a Class of Continuous-Time Optimal Control Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A fast heuristic for the train scheduling problem

Uses Software

• MISER3

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)