Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A mixed integer quadratic programming model for the low autocorrelation binary sequence problem

From MaRDI portal
Publication:2871019
Jump to:navigation, search

zbMATH Open1294.90038MaRDI QIDQ2871019FDOQ2871019


Authors: Jozef Kratica Edit this on Wikidata


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


zbMATH Keywords

quadratic programminginteger programminglow autocorrelation binary sequence problem


Mathematics Subject Classification ID

Quadratic programming (90C20) Mixed integer programming (90C11)







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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2871019&oldid=15817137"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:28. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki