Course Description

Course CodeCourse NameCreditsHours
3736038 Network Models and Integer Programming 3.0 3
Description This course introduces the theory and characteristics of network and integer programming problems. In network models, basic graph theory along with network optimization algorithms is included to have a comprehensive understanding. Introduction to integer programming problems such as traveling salesman problems as well as detail study of valid inequalities and branch-and-bound method, including the concepts, techniques, mathematical analysis and justification. Emphasis is placed on the rigorous theoretical foundations that give rise to solution algorithms.