Improved Branch-and-Bound for Low Autocorrelation Binary Sequences

Autor:	Prestwich, S. D.
Rok vydání:	2013
Předmět:	Computer Science - Artificial Intelligence
Druh dokumentu:	Working Paper
Popis:	The Low Autocorrelation Binary Sequence problem has applications in telecommunications, is of theoretical interest to physicists, and has inspired many optimisation researchers. Metaheuristics for the problem have progressed greatly in recent years but complete search has not progressed since a branch-and-bound method of 1996. In this paper we find four ways of improving branch-and-bound, leading to a tighter relaxation, faster convergence to optimality, and better empirical scalability. Comment: Journal paper in preparation
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1305.6187 Zobrazit plný text záznamu View this record from Arxiv