Prerequisites: Basic knowledge of linear programming and analysis of algorithms or combinatorial optimization. The design and analysis of efficient algorithms for providing near-optimal solutions to NP-hard problems. Classic algorithms and recent techniques for approximation algorithms.
Department: Industrial Engineering and Operations Research(IEOR)
Subject: Industrial Engineering and Operations Research(IEOR)
School: Fu Foundation School of Engineering and Applied Science
Division: School of Engineering and Applied Science: Graduate
Course ID: 6610