On solving the quadratic shortest path problem

Research output: Contribution to journalArticleScientificpeer-review

Abstract

The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized. We derive several semidefinite programming relaxations for the quadratic shortest path problem with a matrix variable of order m+1, where m is the number of arcs in the graph. We use the alternating direction method of multipliers to solve the semidefinite programming relaxations. Numerical results show that our bounds are currently the strongest bounds for the quadratic shortest path problem. We also present computational results on solving the quadratic shortest path problem using a branch and bound algorithm. Our algorithm computes a semidefinite programming bound in each node of the search tree, and solves instances with up to 1300 arcs in less than an hour.
Original languageEnglish
Pages (from-to)219-233
JournalINFORMS Journal on Computing
Volume32
Issue number2
DOIs
Publication statusPublished - Apr 2020

Keywords

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

Fingerprint Dive into the research topics of 'On solving the quadratic shortest path problem'. Together they form a unique fingerprint.

Cite this