OR 782: Adv Top Combinatorial Optimiz
Course Information from University Catalog
Repeatable within Degree
Studies problems using most recent developments. Topics include cutting plane procedures based on polyhedral combinatorics; column-generation procedures for large, complex problems; heuristic approaches such as genetic algorithms, simulated annealing, and tabu search; study of special structures; reformulation techniques; and bounding approaches. Topics stress most recent developments in field.
Hours of Lecture or Seminar per week: 3
May be repeated for credit when topics are distinctly different.