Online Course
Basic Modeling for Discrete Optimization
University of Melbourne and The Chinese University of Hong Kong via Coursera
-
111
-
- Write review
Overview
Class Central Tips
This course is intended for students interested in tackling all facets of optimization applications. You will learn an entirely new way to think about solving these challenging 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 will allow you to unlock the power of industrial solving technologies, which have been perfected over decades by hundreds of PhD researchers. With access to this advanced technology, problems that are considered inconceivable to solve before will suddenly become easy.
Watch the course promotional video here: https://www.youtube.com/watch?v=hc3cBvtrem0&t=8s
Syllabus
-In this first module, you will learn the basics of MiniZinc, a high-level modeling language for discrete optimization problems. Combining the simplicity of MiniZinc with the power of open-source industrial solving technologies, you will learn how to solve applications such as knapsack problems, graph coloring, production planning and tricky Cryptarithm puzzles, with great ease.
Modeling with Sets
-In this module, you will learn how to model problems involving set selection. In particular, you will see different ways of representing set variables when the variable has no constraints on its cardinality, has fixed cardinality and bounded cardinality. You also have to ensure all model decisions are valid decisions, and each valid decision corresponds to exactly one model decision.
Modeling with Functions
-In this module, you will learn how to model pure assignment problems and partition problems, which are functions in disguise. These problems find applications in rostering and constrained clustering. In terms of modeling techniques, you will see the power of common subexpression elimination and intermediate variables, and encounter the global cardinality constraint for the first time. MiniZinc also provides constraints for removing value symmetries.
Multiple Modeling
-In the final module of this course you will see how discrete optimization problems can often be seen from multiple viewpoints, and modeled completely differently from each viewpoint. Each viewpoint may have strengths and weaknesses, and indeed the different models can be combined to help each other.
Taught by
Prof. Peter James Stuckey and Jimmy Ho Man Lee
Related Courses
-
Advanced Modeling for Discrete Optimization
University of Melbourne, The Chinese University of Hong Kong
-
Solving Algorithms for Discrete Optimization
University of Melbourne, The Chinese University of Hong Kong
-
离散优化建模基础篇 Basic Modeling for Discrete Optimization
The Chinese University of Hong Kong, University of Melbourne
-
FA19: Deterministic Optimization
Georgia Institute of Technology
3.5 -
Discrete Optimization
University of Melbourne
4.3 -
离散优化算法篇 Solving Algorithms for Discrete Optimization
The Chinese University of Hong Kong, University of Melbourne
Reviews
0.0 rating, based on 0 reviews