A note upon minimal path problem

DOI10.1016/0022-247X(70)90154-XzbMath0175.17703OpenAlexW2071769426MaRDI QIDQ2532893

Jaroslav Morávek

Publication date: 1970

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(70)90154-x

zbMATH Keywords

operations research

Related Items (5)

Shortest Paths in Nearly Conservative Digraphs ⋮ Dynamic programming is optimal for certain sequential decision processes ⋮ Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft ⋮ A geometrical method in combinatorial complexity ⋮ Unnamed Item

Cites Work

• On the complexity of discrete programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note upon minimal path problem