Implementation and analysis of alternative algorithms for generalized shortest path problems

DOI10.1016/0305-0548(85)90005-XzbMath0608.90099MaRDI QIDQ1086499

Parviz Partow-Navid, Ronald D. Armstrong, Darwin D. Klingman

Publication date: 1985

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

computational analysisdeterministic dynamic programminggeneralized network problemgeneralized shortest pathprimal extreme point algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear Programming and Sequential Decisions
• A High-Speed Computer Technique for the Transportation Problem
• A Strongly Convergent Primal Simplex Algorithm for Generalized Networks
• Networks with Gains in Discrete Dynamic Programming
• Large-scale linearly constrained optimization
• Testing of a large-scale network optimization program
• Shortest Route Methods for Finite State Space Deterministic Dynamic Programming Problems
• Linear Programming Solutions for Separable Markovian Decision Problems
• Optimization of the flow through networks with gains

This page was built for publication: Implementation and analysis of alternative algorithms for generalized shortest path problems