MaxCut SS
-
Updated
Apr 10, 2020 - Java
MaxCut SS
Algoritms for opeartion Research
A Variable Neighborhood Search for the Median Location Problem with Interconnected Facilities.
Determining good solutions and validating them with a metaheuristic approach in social network influence minimization problems
Exact solver for the Traveling Umpire Problem that uses a branch-and-bound algorithm with decomposition-based lower bounds, implementing the approach developed by T. Â. M. Toffolo (2017).
Add a description, image, and links to the operation-research topic page so that developers can more easily learn about it.
To associate your repository with the operation-research topic, visit your repo's landing page and select "manage topics."