Covers the modeling and solution of discrete problems that arise in business and engineering. Classical techniques such as cutting planes and branch and bound are covered. Emphasizes the application of metaheuristic procedures, such as tabu search and evolutionary approaches, to the solution of practical combinatorial optimization problems. Formerly SYST 7120.