Advanced Modeling for Discrete Optimization

Product type

Advanced Modeling for Discrete Optimization

Coursera (CC)
Logo Coursera (CC)
Provider rating: starstarstarstar_halfstar_border 7.2 Coursera (CC) has an average rating of 7.2 (out of 6 reviews)

Need more information? Get more details on the site of the provider.

Description

When you enroll for courses through Coursera you get to choose for a paid plan or for a free plan

  • Free plan: No certicification and/or audit only. You will have access to all course materials except graded items.
  • Paid plan: Commit to earning a Certificate—it's a trusted, shareable way to showcase your new skills.

About this course: 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…

Read the complete description

Frequently asked questions

There are no frequently asked questions yet. If you have any more questions or need help, contact our customer service.

Didn't find what you were looking for? See also: .

When you enroll for courses through Coursera you get to choose for a paid plan or for a free plan

  • Free plan: No certicification and/or audit only. You will have access to all course materials except graded items.
  • Paid plan: Commit to earning a Certificate—it's a trusted, shareable way to showcase your new skills.

About this course: 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: https://www.youtube.com/watch?v=hc3cBvtrem0&t=8s

Who is this class for: The course is for penultimate/final year undergraduates and graduates in computing and related disciplines. You will need to have basic computer programming skills, and knowledge of fundamental algorithms, discrete mathematics, logic and linear algebra in order to take this course. Please note, this course is also available wholly in Chinese, see: https://www.coursera.org/learn/lisan-youhua-jianmo-gaojiepian

Created by:  The University of Melbourne, The Chinese University of Hong Kong
  • Taught by:  Prof. Jimmy Ho Man Lee, Professor

    Department of Computer Science and Engineering
  • Taught by:  Prof. Peter James Stuckey, Professor

    Computing and Information Systems
Level Intermediate Commitment 5 weeks of study, 6-12 hours/week Language English How To Pass Pass all graded assignments to complete the course. User Ratings 4.9 stars Average User Rating 4.9See what learners said 课程作业

每门课程都像是一本互动的教科书,具有预先录制的视频、测验和项目。

来自同学的帮助

与其他成千上万的学生相联系,对想法进行辩论,讨论课程材料,并寻求帮助来掌握概念。

证书

获得正式认证的作业,并与朋友、同事和雇主分享您的成功。

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. 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.

Syllabus


WEEK 1


Debugging and Improving Models



Similar to computer programs, models can have bugs. In this module, you will see the symptoms (unsatisfiability, too many solutions, too few solutions) of different bugs, and learn methods to discover what is going wrong with your model and how to fix it. Equipped with these tools, you will be able to develop and debug complex models.


22 videos, 5 readings expand


  1. Video: Welcome to Advanced Modeling for Discrete Optimization
  2. 阅读: Course Overview
  3. 阅读: Start of Course Survey
  4. Video: 2.1.1 Model Debugging
  5. Video: 2.1.2 Tracing Models
  6. Video: 2.1.3 Relational Semantics
  7. Video: 2.1.4 Too Many Solutions
  8. Video: 2.1.5 Missing Solutions
  9. Video: 2.1.6 Basic Model Improvement
  10. Video: 2.1.7 Module 1 Summary
  11. 阅读: Getting MiniZinc
  12. 阅读: Workshop 5: Poetry Challenge
  13. Video: Workshop 5 Solution
  14. Video: Assignment Submission - IDE
  15. Video: Assignment Submission - CLI
  16. 阅读: About the Reference Material
  17. Video: Reference 1: Basic Features
  18. Video: Reference 2: Booleans Expressions
  19. Video: Reference 3: Sets, Arrays and Comprehensions
  20. Video: Reference 4: Enumerated Types
  21. Video: Reference 5: Strings and Output
  22. Video: Reference 6: Option Types
  23. Video: Reference 7: Predicates
  24. Video: Reference 8: Flattening
  25. Video: Reference 9: Transforming Data
  26. Video: Reference 10: User Defined Functions
  27. Video: Reference 11: Command Line Interface

Graded: Escape to Jing Province

WEEK 2


Predicates



In this module, you will learn how to encapsulate a complex constraint definition in a predicate definition to enable its reuse. This will enable the construction of far more complex models with improved readability in a modular manner. You will also encounter for the first time a problem with multiple objectives and learn how to compress them into one single objective. In addition to this, you will learn how to model the banquet seating problem, which will assist you in many occasions in life.


6 videos, 1 reading expand


  1. Video: 2.2.1 Predicates
  2. Video: 2.2.2 The let-in Construct
  3. Video: 2.2.3 Using Predicates
  4. Video: 2.2.4 Contexts
  5. Video: 2.2.5 Module 2 Summary
  6. 阅读: Workshop 6: Weighing an Elephant: Part 1
  7. Video: Workshop 6 Solution

Graded: Weighing the Elephant

WEEK 3


Scheduling



Learn how to tackle complex project scheduling problems of various forms, progressively from ones with only basic precedence requirements to ones with unary resources and even cumulative resources. You will see how to model some of the complex constraints that arise in these applications.


7 videos, 1 reading expand


  1. Video: 2.3.1 Basic Scheduling
  2. Video: 2.3.2 Disjunctive Scheduling
  3. Video: 2.3.3 Cumulative Scheduling
  4. Video: 2.3.4 Sequence Dependent Scheduling 1
  5. Video: 2.3.5 Sequence Dependent Scheduling 2
  6. Video: 2.3.6 Module 3 Summary
  7. 阅读: Workshop 7: Visiting Zhuge Liang
  8. Video: Workshop 7 Solution

Graded: Suitor Schedule

WEEK 4


Packing
In this module, you will learn the important application of packing, from the packing of squares to rectilinear shapes with and without rotation. Again, you will see how to model some of the complex constraints that arise in these applications.


3 videos expand


  1. Video: 2.4.1 Square Packing
  2. Video: 2.4.2 Rectilinear Packing without Rotation
  3. Video: 2.4.3 Rectilinear Packing with Rotation


WEEK 5


Symmetry and Dominance



This final module looks at the various forms of symmetries that can appear in discrete optimization problems. You will learn various methods and special constraints to break such symmetries so as to increase solving efficiency. You will also learn the notion of dominance, which is a generalization of symmetries, and also dominance breaking techniques.


6 videos, 3 readings expand


  1. Video: 2.5.1 Symmetries and LexLeader
  2. Video: 2.5.2 Matrix Model Symmetries
  3. Video: 2.5.3 Value Symmetries
  4. Video: 2.5.4 Dominance
  5. Video: 2.5.5 Module 4 & 5 Summary
  6. 阅读: Where to from here?
  7. 阅读: Workshop 8: The Dieda Plasters
  8. Video: Workshop 8 Solution
  9. 阅读: End of Course Survey

Graded: To Borrow Arrows from Thatched Boats
There are no reviews yet.

    Share your review

    Do you have experience with this course? Submit your review and help other people make the right choice. As a thank you for your effort we will donate $1.- to Stichting Edukans.

    There are no frequently asked questions yet. If you have any more questions or need help, contact our customer service.