Basic Modeling for Discrete Optimization
ofrecido por
The University of Melbourne
The Chinese University of Hong Kong
Basic Modeling for Discrete Optimization
The University of Melbourne
Acerca de este Curso
4.8
133 ratings
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 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
Habilidades que obtendrás
Constraint ProgrammingProblem SolvingMathematical ModelDiscrete Optimization
Programa - Qué aprenderás en este curso
1
Sección
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.
20 videos (Total: 219 min), 6 readings, 1 quiz
20 videos
1.1.1 First Steps14m
1.1.2 Second Model7m
1.1.3 Third Model6m
1.1.4 Models and Instances10m
1.1.5 Modeling Objects8m
1.1.6 Arrays and Comprehensions16m
1.1.7 Global Constraints9m
1.1.8 Module 1 Summary5m
Workshop 0 Solution19m
Workshop 1 Solution21m
Assignment Submission - IDE7m
Assignment Submission - CLI4m
Reference 1: Basic Features13m
Reference 2: Booleans Expressions13m
Reference 3: Sets, Arrays, Comprehensions19m
Reference 4: Enumerated Types7m
Reference 5: Strings and Output8m
Reference 6: Option Types12m
Reference 7: Command Line Interface8m
6 lecturas
Course Overview10m
Start of Course Survey12m
Getting MiniZinc10m
Workshop 0: First Steps20m
Workshop 1: Temperature45m
About the Reference Material2m
2
Sección
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.
6 videos (Total: 64 min), 1 reading, 1 quiz
6 videos
1.2.2 Choosing a Set Representation7m
1.2.3 Choosing a Fixed Cardinality Set10m
1.2.4 Sets with Bounded Cardinality13m
1.2.5 Module 2 Summary3m
Workshop 2 Solution19m
1 lectura
Workshop 2: Surrender Negotiations15m
3
Sección
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.
7 videos (Total: 86 min), 1 reading, 1 quiz
7 videos
1.3.2 Another Assignment Problem Example8m
1.3.3 Modeling Partitions10m
1.3.4 Global Cardinality Constraint9m
1.3.5 Pure Partitioning14m
1.3.6 Module 3 Summary5m
Workshop 3 Solution28m
1 lectura
Workshop 3: Feast Trap50m
4
Sección
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.
6 videos (Total: 67 min), 2 readings, 1 quiz
6 videos
1.4.2 Permutation13m
1.4.3 More Permutation Problem8m
1.4.4 More Multiple Models12m
1.4.5 Module 4 Summary7m
Workshop 4 Solution13m
2 lecturas
Workshop 4: Composition5m
End of Course Survey10m
4.8
Principales revisiones
por MS•Sep 22nd 2018
Great course, but huge gap in difficulty between weeks two and three, as it seemed to me. Knowledge given by course is applicable both for a work and a hobby for me.
por KP•Oct 4th 2017
very nice introduction to minizinc with great and easy assignments to get you started
Instructores
Prof. Peter James Stuckey
ProfessorComputing and Information Systems
Prof. Jimmy Ho Man Lee
ProfessorDepartment of Computer Science and Engineering
Acerca de The University of 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.
Acerca de The Chinese University of 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.
Preguntas Frecuentes
When will I have access to the lectures and assignments?
Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.
What will I get if I purchase the Certificate?
When you purchase a Certificate you get access to all course materials, including graded assignments. Upon completing the course, your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
What is the refund policy?
Is financial aid available?
¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.
Coursera brinda acceso universal a la mejor educación del mundo, al asociarse con las mejores universidades y organizaciones, para ofrecer cursos en línea.
© 2018 Coursera Inc. Todos los derechos reservados.
