Allocating Debate Judges Using Mathematical Optimization
-
Updated
Nov 20, 2021 - Julia
Allocating Debate Judges Using Mathematical Optimization
Capacitated clustering problem (CCP) solved using Gurobi and heuristic optimization like LP-and-fix and size reduction.
Solving the traveling salesman problem using the Gurobi Solver, the farthest insertion algorithm, the nearest neighbor algorithm and, finally, using the 2-opt optimization method.
Solving the influence maximization problem with independent cascade diffusion model.
Implementation of dualisation and branch and cut to solve a robust capacitated vehicle routing problem
Add a description, image, and links to the gurobi topic page so that developers can more easily learn about it.
To associate your repository with the gurobi topic, visit your repo's landing page and select "manage topics."