Chevron Left
Back to Solving Algorithms for Discrete Optimization

Learner Reviews & Feedback for Solving Algorithms for Discrete Optimization by The University of Melbourne

39 ratings

About the Course

Discrete Optimization aims to make good decisions when we have many possibilities to choose from. Its applications are ubiquitous throughout our society. Its applications range from solving Sudoku puzzles to arranging seating in a wedding banquet. The same technology can schedule planes and their crews, coordinate the production of steel, and organize the transportation of iron ore from the mines to the ports. Good decisions on the use of scarce or expensive resources such as staffing and material resources also allow corporations to improve their profit by millions of dollars. Similar problems also underpin much of our daily lives and are part of determining daily delivery routes for packages, making school timetables, and delivering power to our homes. Despite their fundamental importance, these problems are a nightmare to solve using traditional undergraduate computer science methods. This course is intended for students who have completed Advanced Modelling for Discrete Optimization. In this course, you will extend your understanding of how to solve challenging discrete optimization problems by learning more about the solving technologies that are used to solve them, and how a high-level model (written in MiniZinc) is transformed into a form that is executable by these underlying solvers. By better understanding the actual solving technology, you will both improve your modeling capabilities, and be able to choose the most appropriate solving technology to use. Watch the course promotional video here:

Top reviews

Filter by:

1 - 8 of 8 Reviews for Solving Algorithms for Discrete Optimization

By Alex D

Oct 11, 2018

By Miles G

Sep 24, 2020

By lucas d

Feb 8, 2020

By Boris O

Dec 10, 2019

By Jan G

May 12, 2019

By Leo

Jun 20, 2019


Aug 2, 2020