Login / Signup

A preference-based approach to spanning trees and shortest paths problems****.

Patrice PernyOlivier Spanjaard
Published in: Eur. J. Oper. Res. (2005)
Keyphrases
  • minimum cost flow
  • shortest path
  • shortest path algorithm
  • spanning tree
  • minimum spanning tree
  • shortest path problem
  • upper bound
  • np complete
  • high dimensional
  • optimization problems
  • random walk
  • geodesic distance