MATH 4630 - Discrete Modeling and Optimization

Modeling and solving real-life problems by discrete optimization techniques. The discrete models include integer programming, dynamic programming, network optimization problems. Applications in large economic systems, scheduling, voting theory, telecom and transportation networks are discussed.

Requisites: MATH 3300
Credit Hours: 3.0
Repeat/Retake Information: May be retaken two times excluding withdrawals, but only last course taken counts.
Lecture/Lab Hours: 3.0 lecture
Eligible grades: A-F,WP,WF,FN,FS,AU,I

Add to Portfolio.

Close Window