Course Schedule and Catalog

Department: Comp Appl Math Operations Rsch

Meeting: 4:00PM - 5:15PM MW (13-JAN-2025 - 25-APR-2025) 

Part of Term: Full Term

Grade Mode: Standard Letter

Course Type: Lecture

Language of Instruction: Taught in English

Method of Instruction: Face to Face

Credit Hours: 3

 

Prerequisites: CMOR 360

Section Max Enrollment: 40

Section Enrolled: 6

Total Cross-list Max Enrollment: 40

Total Cross-list Enrolled: 8

Enrollment data as of: 26-DEC-2024 3:31PM

 

 

Final Exam: Scheduled Final Exam-Dept Room

 

Description: Discrete optimization broadly involves finding the best solution from a finite set of possibilities in a computationally efficient manner. Subfields like combinatorial optimization and integer programming are especially popular in industry applications, such as routing deliveries for e-commerce platforms and scheduling virtual machines for cloud companies. In this course, we will explore common discrete problems encountered in practical applications, such as minimum spanning trees, max/min flows, maximum matchings, and scheduling problems. We will analyze the discrete structures underlying these problems and develop algorithms for finding optimal or near-optimal solutions. We will also introduce linear and integer programming to tackle discrete problems. The course will also cover computational complexity and the approximation of several hard problems. Cross-list: INDE 511. Recommended Prerequisite(s): A linear algebra course and COMP 140