This repository contains all the code and the documentation for the project of Combinatorial Decidion Making and Optimization at the University of Bologna. This project was realized for an exam and the goal of it was to solve a combinatorial optimization problem using several techniques such as Constraint Programming (CP) SAT solving, SMT solving and Integer Linear Programming (ILP). In all the folders there is the implementation of the solution, the files with the instances of the problem, some additional scripts and the images containing a visualization of the generated solution.
forked from ApulianGCC/CDMO-VLSI-2021-2022
-
Notifications
You must be signed in to change notification settings - Fork 0
NicolaCarrassi/CDMO-VLSI-2021-2022
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Combinatorial Optimization and decision making: 2D Rectangle Bin Packing Problem
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- Python 48.9%
- Jupyter Notebook 48.7%
- AMPL 2.4%