This repository is about Multiple Courier Planning Problem a well-known NP-hard problem.
-
Updated
Jan 3, 2025 - Python
#
multiple-courier-planning
Here are 2 public repositories matching this topic...
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
-
Updated
Jan 27, 2025 - Python
Improve this page
Add a description, image, and links to the multiple-courier-planning topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the multiple-courier-planning topic, visit your repo's landing page and select "manage topics."