Computing shortest paths in networks derived from recurrence relations

DOI10.1007/BF02073941zbMath0736.90074MaRDI QIDQ1179746

Eugene L. Lawler

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

shortest paths in networksunidirectional and bidirectional search procedures

Mathematics Subject Classification ID

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

Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Bidirectional Heuristic Search Again
• Branch-and-Bound Strategies for Dynamic Programming
• An Improved Bidirectional Heuristic Search Algorithm
• Assembly-Line Balancing—Dynamic Programming with Precedence Constraints