💻
Coding every working day
Operations research and discrete optimization
-
Universidade Federal da Bahia
- Salvador, Brasil
- https://www.linkedin.com/in/januarioccp/
Pinned Loading
-
tsp-lagrange
tsp-lagrange PublicOne-Tree Lagrangian Relaxation for the Traveling Salesman Problem - TSP
C++
-
tsp-bb
tsp-bb PublicA simple Branch and Bound for the Traveling Tournament Problem with Minimum Assignment Problem using the Hungarian Method
C++
-
-
-
cvrp-gilsrvnd
cvrp-gilsrvnd PublicA Greed Iterated Local Search with Variable Neighborhood Descent with Random neighborhood ordering for the Capacitated Vehicle Routing Problem
C++ 2
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page or contact support.
If the problem persists, check the GitHub status page or contact support.