Jul 13, 2024  
2020-2021 Graduate Catalog 
    
2020-2021 Graduate Catalog [NOTE!!!! THIS IS AN ARCHIVED CATALOG. FOR THE CURRENT CATALOG, GO TO CATALOG.NIU.EDU]

ISYE 676 - Discrete Optimization


Study of concepts, theories, and techniques of discrete optimization, both integer and combinatorial. Topics include polyhedral theory, theory of valid inequalities, computational complexity, polynomial algorithms, nonpolynomial algorithms, and nonexact algorithms. Applications include problems in graphs, networks, transportation, and scheduling.

Prerequisites & Notes
PRQ: ISYE 370 or consent of department.

Credits: 3