gummy
A Heuristic solver for QUBO Problems.
Github Link : gummy
As part of a final project in my Scientific Computing course, I implemented Heuristic solver namely :
- Diversification Driven Tabu Search (Glover, 2010),
- Multistart Tabu Search (Palubeckis, 2004),
- and Multistart Simulated Annealing (Katayama and Narihisa, 2001)
to solve QUBO Problems with my group.
We created some class to mount different kind of heuristics in C++. We find that Diversification Driven Tabu Search performs bests. There are specific instances in sparse problems where simulated annealing performs better.