This repository contains implemented models from Operations Research using IBM CPLEX.
A model that provides a minimum number of shelves and shelf occupancy for a given quantity of products in supermarkets. by using a cutting stock problem. The cutting stock problem is implemented via column generation.
Solves any as input given sudoku riddle using constraint programming.
Creates a schedule of optional and emergency surgeries for a operating room using again constrain programming.
Travelling Salesman Problem (TSP)
Solves any given TSP by using a cutting-plane method.
Travelling Salesman Problem with CP
Solves any given TSP by using constraint programming.