Login to filter by course Login to filter by course Reset
Explores fundamental groups, homotopy classes, and coverings in connected manifolds.
Explores the implications of transforming a shortest path problem into a longest path problem in optimization.
Introduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.
Covers complementarity slackness, optimality conditions, proofs, negative cost cycles, and simple paths in network optimization.
Introduces PERT for project management, determining project duration and critical tasks through network modeling and longest path calculation.
Explains paths in networks, including simple paths and cycles.
