Performance of various methods for the solution of binary quadratic programming problems
Fumihiro Hasegawa, Jie Luo, Krishna Rao Pattipati, Peter Willett · 2002
We (2001) previously showed that for solutions of the binary quadratic programming problem there exists an "efficient frontier" in the performance/speed domain among the algorithms which characterizes the relative performance of each algorithm. Here, in addition to the algorithms implemented previously, the Boltzmann machine, genetic algorithm and space alternating generalized EM (SAGE) receiver are implemented and results are given for much larger scale problems. Simulation results show that these and several other of the proposed methods can significantly outperform the decision feedback detector or its group counterpart.