This is the repository for the code of my Computer Science bachelor's degree final paper.
-
Updated
Nov 16, 2018 - Python
This is the repository for the code of my Computer Science bachelor's degree final paper.
Network Flows Optimization - Shortest Path, Max Flow and Min Cost Flow Algorithms in Python
An efficient algorithm for solving data association problems modelled as a Minimum cost flow problem applied in the field of Multi Object Tracking
NR-Router is a tool that enables precise routing on glass-based and paper-based digital microfluidic EWOD (Electrowetting on Dielectric) chips with non-regular electrodes.
University project developed for The OC course at university of Turin in 2023, it is a study of the MC-MCF problem
Decision making of textile production in H company: customer management and production tasks distribution
An example of Successive Shortest Path (with Dijkstra's algorithm)
Add a description, image, and links to the min-cost-flow topic page so that developers can more easily learn about it.
To associate your repository with the min-cost-flow topic, visit your repo's landing page and select "manage topics."