On Solving the Quadratic Shortest Path Problem

DOI10.1287/ijoc.2018.0861zbMath1451.90018arXiv1708.06580MaRDI QIDQ3386757

Renata Sotirov, Hao Hu

Publication date: 7 January 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.06580

zbMATH Keywords

semidefinite programming; branch and bound; alternating direction method of multipliers; quadratic shortest path problem

Mathematics Subject Classification ID

90C22: Semidefinite programming

90B06: Transportation, logistics and supply chain management

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

Uses Software

• CPLEX
• Mosek
• ADMM_QAP