Feasibility verification and upper bound computation in global minimization using approximate active index sets
Year of publication: |
2024
|
---|---|
Authors: | Füllner, Christian ; Kirst, Peter ; Otto, Hendrik ; Rebennack, Steffen |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 6, p. 1737-1756
|
Subject: | active index sets | branch-and-bound | convergence | deterministic upper bounds | feasibility verification | global optimization | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Solving linear multiplicative programs via branch-and-bound : a computational experience
Cambini, Riccardo, (2023)
-
A practicable branch and bound algorithm for sum of linear ratios problem
Jiao, Hong-Wei, (2015)
-
Buchheim, Christoph, (2015)
- More ...
-
Kindler, Peter, (2006)
-
A general branch-and-bound framework for continuous global multiobjective optimization
Eichfelder, Gabriele, (2021)
-
Globally optimal univariate spline approximations
Mohr, Robert, (2023)
- More ...