Login / Signup
The quadratic shortest path problem: complexity, approximability, and solution methods.
Borzou Rostami
André B. Chassein
Michael Hopf
Davide Frey
Christoph Buchheim
Federico Malucelli
Marc Goerigk
Published in:
Eur. J. Oper. Res. (2018)
Keyphrases
</>
preprocessing
shortest path problem
significant improvement
computational complexity
machine learning methods
unsupervised learning
computational cost
linear equations
heuristic methods
benchmark datasets
shortest path
graphical models
bayesian networks
multi objective
special case
pairwise
optimal solution