On the Quadratic Shortest Path Problem
Finding the shortest path in a directed graph is one of the most important combinatorial optimization problems, having applications in a wide range of fields. In its basic version, however, the problem fails to represent situations in which the value of the objective function is determined not only by the choice of each single arc, but also by the combined presence of pairs of arcs in the solution. In this paper we model these situations as a Quadratic Shortest Path Problem, which calls for the minimization of a quadratic objective function subject to shortest-path constraints. We prove strong NP-hardness of the problem and analyze polynomially solvable special cases, obtained by restricting the distance of arc pairs in the graph that appear jointly in a quadratic monomial of the objective function. Based on this special case and problem structure, we devise fast lower bounding procedures for the general problem and show computationally that they clearly outperform other approaches proposed in the literature in terms of their strength.
KeywordsShortest Path Problem Quadratic 0–1 optimization Lower bounds
Unable to display preview. Download preview PDF.
- 4.Buchheim, C., Traversi, E.: Quadratic 0–1 optimization using separable underestimators. Tech. rep., Optimization Online (2015)Google Scholar
- 10.Murakami, K., Kim, H.S.: Comparative study on restoration schemes of survivable atm networks. In: INFOCOM 1997. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 1, pp. 345–352. IEEE (1997)Google Scholar