Prevent this user from interacting with your repositories and sending you notifications.
Learn more about blocking users.
You must be logged in to block users.
Contact GitHub support about this user’s behavior.
Learn more about reporting abuse.
One-Tree Lagrangian Relaxation for the Traveling Salesman Problem - TSP
A simple Branch and Bound for the Traveling Tournament Problem with Minimum Assignment Problem using the Hungarian Method
A Column Generation for the Bin Packing problem
Branch and Cut for the Traveling Salesman Problem with the min-cut separation
A Branch and Price for the Bin Packing Problem
A Greed Iterated Local Search with Variable Neighborhood Descent with Random neighborhood ordering for the Capacitated Vehicle Routing Problem
Seeing something unexpected? Take a look at the
GitHub profile guide.