IE8531: Discrete Optimization

4 Credits

Topics in integer programming and combinatorial optimization. Formulation of models, branch-and-bound. Cutting plane and branch-and-cut algorithms. Polyhedral combinatorics. Heuristic approaches. Introduction to computational complexity.

View on University Catalog

All Instructors

A- Average (3.729)Most Common: A (44%)

This total also includes data from semesters with unknown instructors.

45 students
SWFDCBA

  • 4.71

    /5

    Recommend

  • 4.57

    /5

    Effort

  • 4.77

    /5

    Understanding

  • 4.79

    /5

    Interesting

  • 4.57

    /5

    Activities

  • Samyok Nepal

    Website/Infrastructure Lead

  • Kanishk Kacholia

    Backend/Data Lead

  • Joey McIndoo

    Feature Engineering

Contribute on our Github

Gopher Grades is maintained by Social Coding with data from Summer 2017 to Fall 2024 provided by the Office of Institutional Data and Research

Privacy Policy