๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Efficient Algorithm for QCDP and Implementation

โœ Scribed by Shieh-Shing Lin; Chi-Hsin Lin; Shih-Cheng Horng


Book ID
118063492
Publisher
IEEE
Year
2010
Tongue
English
Weight
620 KB
Volume
25
Category
Article
ISSN
0885-8950

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An efficient implementation of an algori
โœ Hadjiconstantinou, E.; Christofides, N. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 263 KB ๐Ÿ‘ 1 views

In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho