ECE440 Integer Programming and Combinatorial Optimization

Formulation and applications of integer and mixed integer programming problems. Clever uses of binary variables to formulate models. Branch and bound method. Cutting plane method. Design and analysis of algorithms, combinatorial optimization. Complexity of algorithms. Applications on networks and graphs. Solution of problems using local optimization techniques, dynamic programming, myopic algorithms, approximate and heuristic methods. Applications of operational research

The aim is to introduce the students to the fundamental principles of integer programming and combinatorial optimization and their applications. Additionally, emphasis is given on the procedure of designing and analyzing optimization algorithms. After the end of the class, the students should be able to formulate problems, develop optimization techniques, design solution procedures and use advanced tools for the solution of mathematical models.
Upon successful completion of this course, the student will be able to:

• Develop a modeling approach for many engineering problems
• Define mathematical models representing engineering problem
• Find the appropriate solution approach
• Use an optimization software