Sciweavers

4OR
2010
82views more  4OR 2010»
13 years 11 months ago
Diversification-driven tabu search for unconstrained binary quadratic problems
This paper describes a Diversification-Driven Tabu Search (D2 TS) algorithm for solving unconstrained binary quadratic problems. D2 TS is dis
Fred Glover, Zhipeng Lü, Jin-Kao Hao
ICASSP
2008
IEEE
14 years 6 months ago
Efficient soft demodulation of MIMO QPSK via semidefinite relaxation
We develop a computationally efficient and memory efficient approach to (near) maximum a posteriori probability demodulation for MIMO systems with QPSK signalling, based on semi...
Mehran Nekuii, Mikalai Kisialiou, Timothy N. David...
CVPR
2007
IEEE
15 years 1 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl