UQP heuristic methods

  • Shankarachary Ragi (Contributor)



Here, several heuristic methods to solve UQP are included: domeig.m contains the dominant eigenvector matching heuristic greedy.m contains the greedy strategy rswapgreedy.m contains the row-swap greedy strategy sdprel.m contains the semidefinite relaxation method pwr.m contains the power method sim_run.m is the main file, which calls each of the above methods and compares the performance. Preprint available at http://www.optimization-online.org/DB_FILE/2016/12/5763.pdf
Date made availableJan 1 2017
PublisherCode Ocean

Cite this