Catalog Entries |
Spring 2024
Apr 17, 2025 |
|
 |
||
 | The pre-requisites listed in this catalog are those approved by the Curriculum Committee.
For pre-requisite information specific to an individual instance of a course, please see the schedule of classes. Click the Schedule Type to find available offerings of the course on the Schedule of Classes. |
| ISYE 6662 - Discrete Optimization |
|
Fundamentals of integer and combinatorial optimization. Topics include polyhedra, cuts, Lagrangean duality, complexity, and others. This course is intended for Ph.D. students.
3.000 Credit hours 3.000 Lecture hours Grade Basis: ALP All Sections for this Course Sch/Industrial & Systems Engr Department |
|