-
Crossing the Bridge at Night
How to get 4 people across a dark bridge in the shortest time possible?
-
Map Coloring
How many colors do you need to color a map so that no two neighboring countries share the same color?
-
Einstein's Riddle
Is it true that only 2% of people can solve it? Let's solve it using binary optimization
-
Constrained Non-Linear Optimization, the conditions hiding the optimum
Discovering how the Karush-Kuhn-Tucker conditions connect the objective function and constraints to characterize optimal solutions
-
Gomory fractional cuts, the power of a good cut
Discover how Gomory cuts eliminate fractional solutions to bring us closer to the optimal integer solution
-
Finding the needle without searching the entire haystack
An intuitive introduction to the Branch and Bound algorithm
-
Modeling Decisions with Binary Variables
Learning to formulate implications, disjunctions, fixed costs, and other common constraints in integer optimization
