This course provides a comprehensive introduction to the fundamental concepts, models, and algorithms used to optimize complex networks. Students explore essential graph theory, shortest path algorithms, minimum spanning trees, maximum flow and minimum cost flow techniques, and matching and assignment models. The course also examines network design strategies, reliability and robustness considerations, and recent advancements in the field. Through practical examples and real-world applications, learners gain the skills needed to analyze, design, and optimize a wide range of networked systems.