A mixed integer quadratic programming model for the low autocorrelation binary sequence problem
From MaRDI portal
Publication:2871019
zbMATH Open1294.90038MaRDI QIDQ2871019FDOQ2871019
Authors: Jozef Kratica
Publication date: 21 January 2014
Published in: Serdica Journal of Computing (Search for Journal in Brave)
Recommendations
- Low autocorrelation binary sequences
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- A mixed integer linear programming formulation for low discrepancy consecutive \(k\)-sums permutation
This page was built for publication: A mixed integer quadratic programming model for the low autocorrelation binary sequence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2871019)