CSCI 658 - Discrete Optimization

Credits: 3 Prerequisite(s): CSCI 628

Topics include relaxation techniques, constructive heuristics, improving search techniques (simplex method simulated annealing, tabu search), branch and bound schemes, and valid inequalities for branch and cut methods. Problems will be solved using appropriate software tools.