A note upon minimal path problem

DOI10.1016/0022-247X(70)90154-XMaRDI QIDQ2532893zbMATH OpenOpenAlexFDO

Authors 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

Cites work

• scientific article; zbMATH DE number 3121282 (Why is no real title available?)
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3207751 (Why is no real title available?)
• scientific article; zbMATH DE number 3330531 (Why is no real title available?)
• scientific article; zbMATH DE number 3341035 (Why is no real title available?)
• On the complexity of discrete programming problems

Cited in

(5)

• Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft
• Shortest paths in nearly conservative digraphs
• A geometrical method in combinatorial complexity
• Dynamic programming is optimal for certain sequential decision processes
• scientific article; zbMATH DE number 3393931 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2532893)