Chevron Left
Voltar para Solving Algorithms for Discrete Optimization

Comentários e feedback de alunos de Solving Algorithms for Discrete Optimization da instituição Universidade de Melbourne

4.8
estrelas
39 classificações

Sobre o curso

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: https://www.youtube.com/watch?v=-EiRsK-Rm08...

Melhores avaliações

Filtrar por:

1 — 8 de 8 Avaliações para o Solving Algorithms for Discrete Optimization

por Alex D

11 de out de 2018

por Miles G

24 de set de 2020

por lucas d

8 de fev de 2020

por Boris O

10 de dez de 2019

por Jan G

12 de mai de 2019

por Leo

20 de jun de 2019

por VAISHNAVI S

2 de ago de 2020