A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
Year of publication: |
2015
|
---|---|
Authors: | Buchheim, Christoph ; De Santis, Marianna ; Palagi, Laura |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 4, p. 384-388
|
Subject: | Integer programming | Quadratic programming | Global optimization | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
An empirical analysis of exact algorithms for the unbounded knapsack problem
Becker, Henrique, (2019)
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
- More ...
-
De Santis, Marianna, (2020)
-
An Exact Algorithm for Quadratic Integer Minimization using Nonconvex Relaxations
Buchheim, Christoph, (2012)
-
Designing sustainable diet plans by solving triobjective integer programs
Benvenuti, Luca, (2024)
- More ...