CSE 460
Optimization and Constraint Solving

This page contains resources for the Optimization and Constraints Solving subject (CSE 460).
New Material will be made available in the various areas as it is introduced in the lectures.
 

• Intro & Syllabus
• Complete Lecture Notes in B & W, 4 slides per page (10 MB PDF)
• Separate Lecture Notes in Colour, 1 slide per page
• Introduction; Computational Complexity; Cook's Theorem;
• Linear Programming; Simplex Method;
• Integer and Mixed Integer Programming: Network Flow; Branch & Bound Methods;
• Duality;
• Euler-Lagrange Multiplier Methods; Kuhn-Tucker Conditions;
• Non-linear (Quadratic) Programming;
• Interior Point Methods (if time allows);
Introduction to Stochastic Constraint Solving and Optimization;
• Meta-Heuristics: Tabu Search, Simulated Annealing;
• Ant Colony Optimization;
• Genetic Algorithms;
• Constraint Handling in Meta-Heuristics (optional, time permitting).
• Assignments