Lecture

Shortest path: Properties

Description

This lecture covers the complementarity slackness for the transhipment problem, optimality conditions, and proofs related to network paths, labels, and costs. It also discusses negative cost cycles and the concept of simple paths.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.