Linearizable Special Cases of the Quadratic Shortest Path Problem.
Eranda ÇelaBettina KlinzStefan LendlJames B. OrlinGerhard J. WoegingerLasse WulfPublished in: WG (2021)
Keyphrases
- shortest path problem
- special case
- shortest path
- computational complexity
- single source
- interval data
- bicriteria
- bi objective
- combinatorial optimization problems
- directed graph
- objective function
- np hard
- multiple objectives
- pairwise
- quadratic assignment problem
- quadratic function
- approximation algorithms
- directed acyclic graph
- upper bound
- data sets