Exploiting relaxation in local search for LABS

Steven Prestwich ()

Annals of Operations Research, 2007, vol. 156, issue 1, 129-141

Abstract: Branch-and-bound uses relaxation to prune search trees but sometimes scales poorly to large problems. Conversely, local search often scales well but may be unable to find optimal solutions. Both phenomena occur in the construction of low-autocorrelation binary sequences (LABS), a problem arising in communication engineering. This paper proposes a hybrid approach to optimization: using relaxation to prune local search spaces. An implementation gives very competitive results, showing the feasibility of the approach. Copyright Springer Science+Business Media, LLC 2007

Keywords: Optimization; Relaxation; Hybrid local search; LABS (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-007-0226-9 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:156:y:2007:i:1:p:129-141:10.1007/s10479-007-0226-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-007-0226-9

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().