You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Combinatorial Decision Making and Optimization project on Very Large Scale Integration (VLSI) with Constraint Programming (CP), propositional SATisfiability (SAT), and Satisfiability Modulo Theories (SMT)
Competitive Programming questions and their solutions from various sources including LeetCode, Hackerrank, Google Kickstart, Codechef and more platforms.
This project, also known as the Vehicle Routing Problem (VRP), addresses the Multiple Couriers Planning (MCP) problem using Constraint Programming (CP), Satisfiability Modulo Theories (SMT), and Mixed-Integer Linear Programming (MIP) to optimize courier routes efficiently.
This repository contains the solution of the Multiple Couriers Planning (MCP) problem using several technique (SAT, MIP, SMT, CP) for Combinatorial Decision Making and Optimization 2023/2024 course