A note upon minimal path problem

DOI10.1016/0022-247X(70)90154-XzbMATH Open0175.17703OpenAlexW2071769426MaRDI QIDQ2532893FDOQ2532893

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of discrete programming problems
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Shortest paths in nearly conservative digraphs
• Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft
• A geometrical method in combinatorial complexity
• Title not available (Why is that?)
• Dynamic programming is optimal for certain sequential decision processes

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)