BulDML at Institute of Mathematics and Informatics >
IMI Periodicals >
Serdica Journal of Computing >
2012 >
Volume 6 Number 4 >

Please use this identifier to cite or link to this item:

Title: A Mixed Integer Quadratic Programming Model for the Low Autocorrelation Binary Sequence Problem
Authors: Kratica, Jozef
Keywords: Integer Programming
Quadratic Programming
Low Autocorrelation Binary Sequence Problem
Issue Date: 2012
Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation: Serdica Journal of Computing, Vol. 6, No 4, (2012), 385p-400p
Abstract: In this paper the low autocorrelation binary sequence problem (LABSP) is modeled as a mixed integer quadratic programming (MIQP) problem and proof of the model’s validity is given. Since the MIQP model is semidefinite, general optimization solvers can be used, and converge in a finite number of iterations. The experimental results show that IQP solvers, based on this MIQP formulation, are capable of optimally solving general/skew-symmetric LABSP instances of up to 30/51 elements in a moderate time. ACM Computing Classification System (1998): G.1.6, I.2.8.
ISSN: 1312-6555
Appears in Collections:Volume 6 Number 4

Files in This Item:

File Description SizeFormat
sjc-vol6-num4-2012-p385-p400.pdf152.21 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!   Creative Commons License