Quadratic combinatorial optimization using separable underestimators
Year of publication: |
2018
|
---|---|
Authors: | Buchheim, Christoph ; Traversi, Emiliano |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 30.2018, 3, p. 424-437
|
Subject: | binary quadratic optimization | separable underestimators | quadratic shortest path problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Mathematik | Mathematics |
-
Exact facetial odd-cycle separation for maximum cut and binary quadratic optimization
Jünger, Michael, (2021)
-
On solving the quadratic shortest path problem
Hu, Hao, (2020)
-
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
Fomeni, Franklin Djeumou, (2021)
- More ...
-
Convex optimization under combinatorial sparsity constraints
Buchheim, Christoph, (2022)
-
Bettiol, Enrico, (2022)
-
A constraints-aware Reweighted Feasibility Pump approach
Frangioni, Antonio, (2021)
- More ...