2005

2010

Learn More

- Linzhong LIU, Bing WU, Yinzhen LI, Jianning YU
- 2005

The quadratic shortest path (QSP) problem is to find a path from a node to another node in a given network such that the total cost includes two kinds of costs, say direct cost and interactive cost, is minimum. The direct cost is the cost associated with each arc and the interactive cost occurs when two arcs appear simultaneously in the shortest path. In… (More)

- ‹
- 1
- ›