Norm bounds and underestimators for unconstrained polynomial integer minimization
Year of publication: |
February 2018
|
---|---|
Authors: | Behrends, Sönke ; Hübner, Ruth ; Schöbel, Anita |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 87.2018, 1, p. 73-107
|
Subject: | Integer optimization | Polynomials | Lower bounds | Branch and bound | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Álvarez-Miranda, Eduardo, (2024)
-
Stochastic assembly line balancing : general bounds and reliability-based branch-and-bound algorithm
Diefenbach, Johannes, (2022)
-
Lower bounds for a bin packing problem with linear usage cost
Braune, Roland, (2019)
- More ...
-
When is rounding allowed in integer nonlinear optimization?
Hübner, Ruth, (2014)
-
When is rounding allowed in integer nonlinear optimization?
Hübner, Ruth, (2014)
-
Bergquist, Rickard, (2011)
- More ...