Computing shortest paths in networks derived from recurrence relations
From MaRDI portal
Publication:1179746
DOI10.1007/BF02073941zbMath0736.90074MaRDI QIDQ1179746
Publication date: 27 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Dynamic programming (90C39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Cites Work