Branch-and-Price-and-Cut in Julia
-
Updated
Sep 8, 2025 - Julia
Branch-and-Price-and-Cut in Julia
BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
Solve optimization problems and build custom algorithms
A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
BCP2-MAPF – branch-and-cut-and-price for multi-agent path finding, version 2
Network optimisation solver
This project contains the material for the final exam project of the Mathematical Optimisation course for the academic year 2024-25. This course is offered by UniTS (Università degli Studi di Trieste), Trieste, Italy.
Add a description, image, and links to the branch-and-cut-and-price topic page so that developers can more easily learn about it.
To associate your repository with the branch-and-cut-and-price topic, visit your repo's landing page and select "manage topics."