The transhipment problem: The shortest path problem

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Page 2 of 3

Optimisation Strategies: Energy Systems Modelling and Optimization

Explores solving strategies for energy system optimization problems and different types of optimization approaches.

Energy System Modeling: Optimization and Performance Indicators

Explores energy system modeling using optimization techniques and performance indicators.

Dijkstra's Algorithm and Shortest Path

Covers Dijkstra's algorithm for shortest path problems and its application in ALL-TO-ONE and ALL-PAIRS algorithms.

Dynamic Programming: Bellman-Ford and Dijkstra

Explores dynamic programming with Bellman-Ford, Dijkstra, greedy strategies, and activity scheduling problems.

Set Cover: Integrality Gap

Explores the integrality gap concept in set cover and multiplicative weights algorithms.

Optimization with Constraints: KKT Conditions

Covers the optimization with constraints, focusing on the Karush-Kuhn-Tucker (KKT) conditions.

The transhipment problem, The maximum flow problem

Explores the maximum flow and transhipment problems in network optimization.

Geometric Computing Laboratory: Inverse Design Optimization

Explores inverse design optimization in geometric computing, covering topics such as deployable structures, material-aware design, and programmed materials.

Stochastic Softmax Tricks

Explores stochastic softmax tricks, reparametrization, and argmax, addressing challenges in expectation estimation and gradient variance.

Optimization Principles

Covers optimization principles, including linear optimization, networks, and concrete research examples in transportation.