Complexity and experimental evaluation of primal-dual Shortest Path Tree algorithms

Authors
Festa, P Cerulli, R Raiconi, G
Citation
P. Festa et al., Complexity and experimental evaluation of primal-dual Shortest Path Tree algorithms, NONC OPTIM, 42, 2000, pp. 189-208
Categorie Soggetti
Current Book Contents","Current Book Contents
Journal title
APPROXIMATION AND COMPLEXITY IN NUMERICAL OPTIMIZATION : CONTINUOUS AND DISCRETE PROBLEMS → ACNP
Volume
42
Year of publication
2000
Pages
189 - 208
Database
ISI
SICI code