Two-dimensional phase unwrapping via balanced spanning forests
Year of publication: |
2019
|
---|---|
Authors: | Herszterg, Ian ; Poggi, Marcus ; Vidal, Thibaut |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 31.2019, 3, p. 527-543
|
Subject: | phase unwrapping | signal processing | combinatorial optimization | graphs | mathematical programming | branch-and-cut | metaheuristics | Mathematische Optimierung | Mathematical programming | Mathematik | Mathematics | Graphentheorie | Graph theory |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Sum-of-squares representations for copositive matrices and independent sets in graphs
Vargas, Luis, (2023)
-
An SDP-based approach for computing the stability number of a graph
Gaar, Elisabeth, (2022)
- More ...
-
New benchmark instances for the capacitated vehicle routing problem
Uchoa, Eduardo, (2017)
-
Vehicle routing with stochastic demands and partial reoptimization
Florio, Alexandre M., (2022)
-
Near real-time loadplan adjustments for less-than-truckload carriers
Herszterg, Ian, (2022)
- More ...