This course teaches you how to tackle complex search problems using discrete optimization concepts and algorithms, including constraint programming, local search, and mixed-integer programming.
This introductory course on discrete optimization covers fundamental concepts and algorithms, providing a solid foundation in constraint programming, local search, and mixed-integer programming. You'll learn to apply these techniques to practical problems in scheduling, vehicle routing, supply-chain optimization, and resource allocation.
🆓 Free to Audit
🕒 Approx. 65 Hours
✏️Intermediate Level
🧾 Paid Certificate Available Upon Completion
🎓 Offered by The University of Melbourne via Coursera
