CMSC 657 - Networks and Combinatorial Optimization

Credits: [3]

Description: Graph theoretic concepts, uni-modular matrices, transportation problems, minimum-cost network flows, maximal flows in networks, shortest-path algorithms, spanning three problems, multi-commodity flows and decomposition algorithms, assignment and matching problems, computational complexity of algorithms matroid theory and nonlinear network minimization.
Course ID: 053025
Prerequisite: Prerequisite: CMSC 641 or consent of instructor.
Components: Lecture
Grading Method: A-F, Pass/Fail, Audit