Learn More
  • A. De, AzevedoJoaquim, +7 authors de Matem
  • 1990
The ranking of K shortest paths is a classical network optimization problem with a large range of real world applications. Take as an example the constrained shortest path problem, where some complex(More)