MiniZinc: Modeling with Sets
A typical problem requiring us to select a subset from a set of objects that meets some criteria...
MiniZinc Introduction
MiniZinc allows us to directly describe and solve discrete optimization problems. MiniZinc is a modeling language, you can...
Discrete Optimization: Scheduling, Column Generation
Scheduling is one of the most fascinating areas of Discrete Optimization. They are beautiful scientifically meanwhile there is...
Discrete Optimization: Mixed Integer Program
Mixed Integer Program is a big field. Essentially a mixed integer program is a linear program with m...
Discrete Optimization: Linear Programming
Invented by George Dantzig in 1947, Linear Programming is one of the most fundamental tools in combinatorial optimization. You...
Discrete Optimization: Local Search
Previously we talked about constraint programming, which actually works with partial assignments, we try to extend them, and...
Discrete Optimization: Constraint Programming
Constraint Programming is one of the main paradigms to actually tackle optimization problems. The idea is to look...
Discrete Optimization: Knapsack Problems
Filling a knapsack is an NP-hard optimization problem, it is widely believed that in the worst case it...