ORIE 4330
Course description (from class roster):
Covers basic concepts of graphs, networks, and discrete optimization. Fundamental models and applications, and algorithmic techniques for their analysis. Specific optimization models studied include flows in networks, the traveling salesman problem, and network design.
Offered: Fall.
Prerequisites: ORIE 3300 and CS 2110/ENGRD 2110, or permission of instructor.
Is Python used?
Yes, heavily.
If Python is used, where is it used?
Python is used in labs and on a project.
What is Python used for?
Most of the Python is in Jupyter Notebooks, and involves some implementations of algorithms (e.g., union-find) and formulations of ILPs (with
GurobiPy).
What do I need to know?
You should have a decent understanding of Python; at the minimum, you should be familiar with the material covered in CS 1110, and maybe have some algorithm knowledge on the level of CS 2110. (Actually, CS 2110 is a prerequisite for this course.) If you have experience with GurobiPy and/or OR-Tools already that is a big plus.
Relevant pages