On solving the quadratic shortest path problem
Year of publication: |
2020
|
---|---|
Authors: | Hu, Hao ; Sotirov, Renata |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 32.2020, 2, p. 219-233
|
Subject: | quadratic shortest path problem | semidefinite programming | alternating direction method of multipliers | branch and bound | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Computational results of a semidefinite branch-and-bound algorithm for k-cluster
Krislock, Nathan, (2016)
-
SOS-SDP : an exact solver for minimum sum-of-squares clustering
Piccialli, Veronica, (2022)
-
Quadratic combinatorial optimization using separable underestimators
Buchheim, Christoph, (2018)
- More ...
-
On semidefinite programming relaxations of the traveling salesman problem
Klerk, Etienne de, (2008)
-
A polynomial optimization approach to constant rebalanced portfolio selection
Takano, Yuichi, (2010)
-
Supply chain network downsizing with product line pruning using a new demand substitution
Ashayeri, Jalal, (2015)
- More ...