Abstract
The Low Autocorrelation Binary Sequences problem (LABS) is problem 005 in the CSPLIB library, where it is stated that “these problems pose a significant challenge to local search methods”. This paper presents a straighforward tabu search that systematically finds the optimal solutions for all tested instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beenker, G., Claasen, T., Hermens, P.: Binary Sequences with a Maximally Flat Amplitude Spectrum. Philips Journal of Research 40, 289–304 (1985)
Bernasconi, J.: Low Autocorrelation Binary Sequences: Statistical Mechanics and Configuration Space Analysis. Physique 48, 559 (1987)
Brglez, F., Li, X., Stallman, M., Militzer, B.: Reliable Cost Prediction for Finding Optimal Solutions to LABS Problem: Evolutionary and Alternative Algorithms. In: Fifth International Workshop on Frontiers in Evolutionary Algorithms, Cary, NC, USA (2003)
Gent, I., Walsh, T.: CSPLIB: A Benchmark Library for Constraints, http://csplib.org
Gent, I., Smith, B.: Symmetry Breaking During Search in Constraint Programming. Research Report, 99.02 (1999)
Golay, M.J.: Sieves for Low Autocorrelation Binary Sequences. IEEE Transactions on Information Theory 23, 41–43 (1977)
Golay, M.J.: The Merit Factor of Long Low Autocorrelation Binary Sequences. IEEE Transactions on Information Theory 28, 543–549 (1982)
de Groot, C., Wurtz, D., Hoffmann, K.: Low Autocorrelation Binary Sequences: Exact Enumeration and Optimization by Evolutionary Strategies. Optimization 23, 369–384 (1992)
Mertens, S.: Exhaustive Search for Low Autocorrelation Binary Sequences. J. Phys. A: Math. 29, 473–481 (1996)
Prestwich, S.D.: A Hybrid Local Search for Low Autocorrelation Binary Sequences. Technical Report, TR-00-01 (2000)
Prestwich, S.D.: A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 337–352. Springer, Heidelberg (2000)
Prestwich, S.D.: Negative Effects of Modeling Techniques on Search Performance. Annals of Operations Research 118, 137–150 (2003)
Prestwich, S.D., Roli, A.: Symmetry breaking and local search spaces. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 273–287. Springer, Heidelberg (2005)
Schroeder, M.R.: Number theory in Science and Communication, vol. 118, pp. 137–150. Springer, Berlin (2003)
Shapiro, I., Pettengil, G., Ash, M., Stone, M., Smith, W., Ingalls, R., Brockelman, R.: Fourth Test of General Relativity. Phys. rev. Lett. 20, 1265–1269 (1968)
Wang, Q.: Optimization by Simulating Molecular Evolution. Biol. Cybern. 57, 95–101 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dotú, I., Van Hentenryck, P. (2006). A Note on Low Autocorrelation Binary Sequences. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_51
Download citation
DOI: https://doi.org/10.1007/11889205_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)