Chevron Left
Вернуться к Advanced Modeling for Discrete Optimization

Advanced Modeling for Discrete Optimization, Мельбурнский университет

Оценки: 51
Рецензии: 11

Об этом курсе

Optimization is a common form of decision making, and is ubiquitous in 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 in manpower and material resources management also allow corporations to improve 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, all of these problems are a nightmare to solve using traditional undergraduate computer science methods. This course is intended for students who have completed Basic Modelling for Discrete Optimization. In this course you will learn much more about solving challenging discrete optimization problems by stating the problem in a state-of-the-art high level modeling language, and letting library constraint solving software do the rest. This course will focus on debugging and improving models, encapsulating parts of models in predicates, and tackling advanced scheduling and packing problems. As you master this advanced technology, you will be able to tackle problems that were inconceivable to solve previously. Watch the course promotional video here:

Лучшие рецензии

автор: KP

Oct 03, 2017

very rewarding and challenging assignments, thank you for this great course!

автор: GG

Jun 11, 2018

Fantastic course that really makes you think long and hard.

Фильтр по:

Рецензии: 11

автор: Alex Dainiak

Sep 25, 2018

Great course for those who would like to divert from procedural and object-oriented programming and challenge themselves. The course promotes developing holistic thinking in discrete optimization, as solving most assignments to full grade usually requires developing some really good “global constraints” (these beasts have already appeared in the “Basic Modeling for Discrete Optimization” course). Although the fable based learning approach may frustrate some academic snobs, I guess it is generally fun and does not hinder the essence of the course. Highly recommended.

автор: Geoff Grimwood

Jun 11, 2018

Fantastic course that really makes you think long and hard.

автор: Yorgos

Feb 21, 2018

Great course! Good presentation and lectures, challenging assignments. Learned a lot

автор: Philippe Chervi

Feb 18, 2018

Great course! I particularly appreciated the assignment and the staging which lets you build the final solution in a progressive manner. Looking for course 3 now...

автор: Lozkins Aleksejs

Jan 12, 2018

Nice course for modelling skills upgrade.

автор: jerome

Nov 26, 2017

Lively and engaging course.

If you found "basic modeling" fun, then "advanced modeling" is just as fun, but be warned the assignments will require somewhat more time: about the time indicated, maybe more.

автор: Kamen Petroff

Oct 03, 2017

very rewarding and challenging assignments, thank you for this great course!

автор: Alexandre Proy

Sep 04, 2017

Amazing course! Great instructors and course materials of high quality. I enjoyed very much learning more about advanced modeling for discrete optimization. Will recommend this course and acquire more knowledge in this field!

автор: Carlos Viejo

May 14, 2017

Advanced Modeling for Discrete Optimization is an Excellent course, very challenging and satisfying at the same time; I will highly recommend this course to anyone that is serious about Discrete Optimization.

I will also to extend my thanks to Prof. Jimmy Ho-Man Lee and Prof. Peter James Stuckey for putting together this astounding course and the staff that work in this exceptional narrative to explain the concepts.


автор: Siwei Guo

Mar 21, 2017

Looking forward to course 3!