April 2, 2024
Updated April 14, 2025
16 minute read
The Transportation Analyst: Charting the Course of Movement
Transportation Analysts play a crucial role in shaping how people and goods move through our world. They are the problem-solvers and strategists who study transportation systems, identify inefficiencies, and develop data-driven solutions. This field blends analytical rigor with practical application, offering a chance to impact everything from daily commutes to global supply chains.
5rha8d|
Find a path to becoming a Transportation Analyst. Learn more at:
OpenCourser.com/career/5rha8d/transportation
Reading list
We haven't picked any books for this reading list yet.
Provides a comprehensive overview of network flows. It covers a variety of topics, including shortest paths, maximum flows, and minimum cost flows.
Provides a comprehensive overview of combinatorial optimization. It covers a variety of topics, including shortest paths, network flows, and matchings.
Classic text on algorithms and contains a chapter on shortest paths. It provides a comprehensive overview of the topic and is suitable for both beginners and advanced readers.
Provides a comprehensive overview of approximation algorithms. It covers a variety of topics, including shortest paths, network flows, and matchings.
Provides a unique perspective on graph algorithms by using linear algebra. It covers a variety of topics, including shortest paths, network flows, and matchings.
Provides a comprehensive overview of parallel algorithms. It covers a variety of topics, including shortest paths, network flows, and matchings.
Provides a practical guide to algorithm design and includes a section on shortest paths. It is written in a clear and concise style and is suitable for both students and practitioners.
Provides a comprehensive overview of metaheuristics. It covers a variety of topics, including shortest paths, network flows, and matchings.
Provides an introduction to parameterized algorithms, which are algorithms that take a problem parameter as input. It includes a chapter on shortest paths in parameterized graphs.
French-language introduction to graph algorithms. It covers a variety of topics, including shortest paths, network flows, and matchings.
German-language introduction to graph theory. It covers a variety of topics, including shortest paths, network flows, and matchings.
For more information about how these books relate to this course, visit:
OpenCourser.com/career/5rha8d/transportation
Save
