Solving unconstrained binary polynomial programs with limited reach : Application to low autocorrelation binary sequences
Year of publication: |
2024
|
---|---|
Authors: | Clausen, Jens Vinther ; Crama, Yves ; Lusby, Richard ; Rodríguez-Heck, Elisabeth ; Ropke, Stefan |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 165.2024, Art.-No. 106586, p. 1-13
|
Subject: | Dynamic programming | Low autocorrelated binary sequences | Unconstrained binary polynomial program | Mathematische Optimierung | Mathematical programming | Autokorrelation | Autocorrelation | Dynamische Optimierung | Schätztheorie | Estimation theory |
-
A polynomial-time approximation scheme for sequential batch testing of series systems
Segev, Danny, (2022)
-
Is separately modeling subpopulations beneficial for sequential decision-making?
Lee, Ilbin, (2024)
-
Co-Occurrence : A New Perspective on Portfolio Diversification
Kinlaw, William B., (2023)
- More ...
-
Solving Unconstrained Binary Polynomial Programs with Limited Reach
Clausen, Jens Vinther, (2023)
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (2022)
-
Berge-acyclic multilinear 0–1 optimization problems
Buchheim, Christoph, (2019)
- More ...