![](https://kzhu.ai/wp-content/uploads/2024/03/pawel-czerwinski-dYjFmiQb_aE-unsplash.jpg)
MiniZinc: Modeling with Sets
A typical problem requiring us to select a subset from a set of objects that meets some criteria...
![](https://kzhu.ai/wp-content/uploads/2024/03/nathan-dumlao-kVv8rucgGtc-unsplash.jpg)
MiniZinc Introduction
MiniZinc allows us to directly describe and solve discrete optimization problems. MiniZinc is a modeling language, you can...
![](https://kzhu.ai/wp-content/uploads/2023/12/julia-taubitz-YonLTnjaR6o-unsplash.jpg)
Discrete Optimization: Scheduling, Column Generation
Scheduling is one of the most fascinating areas of Discrete Optimization. They are beautiful scientifically meanwhile there is...
![](https://kzhu.ai/wp-content/uploads/2023/11/markus-krisetya-Vkp9wg-VAsQ-unsplash.jpg)
Discrete Optimization: Mixed Integer Program
Mixed Integer Program is a big field. Essentially a mixed integer program is a linear program with m...
![](https://kzhu.ai/wp-content/uploads/2023/07/d-koi-GU_nNLVna_4-unsplash.jpg)
Discrete Optimization: Linear Programming
Invented byย George Dantzig in 1947, Linear Programming is one of the most fundamental tools in combinatorial optimization. You...
![](https://kzhu.ai/wp-content/uploads/2023/07/joshua-rawson-harris-KRELIShKxTM-unsplash.jpg)
Discrete Optimization: Local Search
Previously we talked about constraint programming, which actually works with partial assignments, we try to extend them, and...
![](https://kzhu.ai/wp-content/uploads/2023/07/joshua-hoehne-U4rGvsvop-s-unsplash.jpg)
Discrete Optimization: Constraint Programming
Constraint Programming is one of the main paradigms to actually tackle optimization problems. The idea is to look...
![](https://kzhu.ai/wp-content/uploads/2023/06/jakob-owens-O_bhy3TnSYU-unsplash.jpg)
Discrete Optimization: Knapsack Problems
Filling a knapsack is an NP-hard optimization problem, it is widely believed that in the worst case it...