Scribd
Upload
20 views

Discrete Optimization: Exploring The Material

The document discusses an open course on discrete optimization that explores topics like constraint programming, local search, and mixed integer programming. It congratulates students for passing the first assignment and encourages them to design their own study plan to explore remaining course materials. It outlines the different paths students can take to complete problem sets and earn certificates, noting that combining quality-based and scalability-based approaches may be needed to earn a distinction. It also provides brief descriptions of each topic to help students match their interests.

Uploaded by

Alex Chen
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Discrete Optimization: Exploring The Material

The document discusses an open course on discrete optimization that explores topics like constraint programming, local search, and mixed integer programming. It congratulates students for passing the first assignment and encourages them to design their own study plan to explore remaining course materials. It outlines the different paths students can take to complete problem sets and earn certificates, noting that combining quality-based and scalability-based approaches may be needed to earn a distinction. It also provides brief descriptions of each topic to help students match their interests.

Uploaded by

Alex Chen
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Discrete

Optimization
Exploring the Material

Goals of the Lecture

Exploring the rest of the course material "


Designing your own study plan

Congratulations!

You have made it this far!"


"

Passed the Knapsack assignment and

getting ready to explore the other course


topics"
Constraint Programming (CP)"
Local Search (LS)"
Mixed Integer Programming (MIP)

Open Course Design


HW1

Intro

CP

LS

MIP

HW2

HW3

HW4

HW5

Optimization Landscape

Solution Quality

OPT

DP, CP"
MIP

Hybrids

10

LS

Problem Size
5

Pick Your Own Optimization Adventure

There are many viable paths through the


course"
Most problem sets have 6 parts graded
on a 10 point scale"

Quality based solution approach (CP,DP,MIP)"


10*4 + 3*2 = 46 points"
Scalability based solution approach (LS)"
7*6 = 42 points"
Either is sufficient to get a certificate"

It may take both to get a distinction


certificate

Matching Your Interest to the Topic

Constraint Programming"
like solving puzzles"
lots of logic / discrete mathematics"
"

Mixed Integer Programming"


grounded in linear algebra"
lots of continuous mathematics"
"

Local Search"
intuition based, most significant coding"
writing efficient code really helps"
lots of staring at the terminal
7

Until Next Time

We hope you enjoy your adventure in to


Discrete Optimization

You might also like