Theoretical and computational study of several linearisation techniques for binary quadratic problems
Year of publication: |
2019
|
---|---|
Authors: | Furini, Fabio ; Traversi, Emiliano |
Published in: |
Annals of operations research ; volume 279, numbers 1/2 (August 2019). - New York, NY, USA : Springer. - 2019, p. 387-411
|
Subject: | Linearisation techniques | Binary quadratic problems | Max cut problem | Quadratic knapsack problem | Quadratic stable set problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
A novel dynamic programming heuristic for the quadratic knapsack problem
Fennich, M. Eliass, (2023)
-
A novel dynamic programming heuristic for the quadratic knapsack problem
Fennich, M. Eliass, (2024)
-
An iterated "hyperplane exploration" approach for the quadratic knapsack problem
Chen, Yuning, (2017)
- More ...
-
Exact approaches for the knapsack problem with setups
Furini, Fabio, (2018)
-
Decomposition methods for hard optimization problems
Furini, Fabio, (2020)
-
Preface: decompostion methods for hard optimization problems
Furini, Fabio, (2020)
- More ...