Shortest and longest path problems

DOI10.1080/02331939608844255MaRDI QIDQ2785406zbMATH OpenOpenAlexFDO

Authors Yuuki Maruyama

Publication date 22 May 1997

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939608844255

zbMATH Keywords

acyclic digraphsbynamic programmingdirected networklongest pathsshortest path problems

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 1062626
• scientific article; zbMATH DE number 2038137
• scientific article; zbMATH DE number 1406530
• On a negative-equivalency theorem in associative optimal path problems

Cites work

• An Appraisal of Some Shortest-Path Algorithms
• From dynamic programming to bynamic programming
• scientific article; zbMATH DE number 3670172 (Why is no real title available?)
• scientific article; zbMATH DE number 3786461 (Why is no real title available?)
• On bidecision processes
• The art and theory of dynamic programming

Cited in

(9)

• Computing shortest paths in networks derived from recurrence relations
• Nearest route problem
• Route intelligent recommendation model and algorithm under the Pythagorean hesitant fuzzy linguistic environment
• The exact path length problem.
• scientific article; zbMATH DE number 1062626 (Why is no real title available?)
• scientific article; zbMATH DE number 2038137 (Why is no real title available?)
• On a negative-equivalency theorem in associative optimal path problems
• scientific article; zbMATH DE number 1406530 (Why is no real title available?)
• The quickest path problem

This page was built for publication: Shortest and longest path problems

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