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.
oferecido por
Basic Modeling for Discrete Optimization
Universidade de MelbourneInformações sobre o curso
Habilidades que você terá
- Constraint Programming
- Problem Solving
- Mathematical Model
- Discrete Optimization
oferecido por
Universidade de Melbourne
The University of Melbourne is an internationally recognised research intensive University with a strong tradition of excellence in teaching, research, and community engagement. Established in 1853, it is Australia's second oldest University.
Universidade Chinesa de Hong Kong
Founded in 1963, The Chinese University of Hong Kong (CUHK) is a forward looking comprehensive research university with a global vision and a mission to combine tradition with modernity, and to bring together China and the West. CUHK teachers and students hail from all corners of the world. CUHK graduates are connected worldwide through an expansive alumni network.
Programa - O que você aprenderá com este curso
MiniZinc introduction
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.
Avaliações
- 5 stars86,44%
- 4 stars11,25%
- 3 stars1,53%
- 2 stars0,25%
- 1 star0,51%
Principais avaliações do BASIC MODELING FOR DISCRETE OPTIMIZATION
A very interesting course! I learned a lot from this course. Thanks instructors!
Certainly more effort went into this course than I was expecting; well worth the $0 cost of entry.
Great introduction to modeling for discrete optimization. Very engaging and challenging.
Wonderful course, very engaging and professionally made. A great course to begin programming in minizinc.
Perguntas Frequentes – FAQ
Quando terei acesso às palestras e às tarefas?
O que recebo ao adquirir o Certificado?
Existe algum auxílio financeiro disponível?
Mais dúvidas? Visite o Central de Ajuda ao estudante.
