Shortest and longest path problems

DOI10.1080/02331939608844255zbMath0863.05041OpenAlexW1982884812MaRDI QIDQ2785406

No author found.

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 digraphsdirected networklongest pathsshortest path problemsbynamic programming

Mathematics Subject Classification ID

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

Related Items (2)

Route intelligent recommendation model and algorithm under the Pythagorean hesitant fuzzy linguistic environment ⋮ On a negative-equivalency theorem in associative optimal path problems

Cites Work

• The art and theory of dynamic programming
• From dynamic programming to bynamic programming
• On bidecision processes
• An Appraisal of Some Shortest-Path Algorithms
• Unnamed Item
• Unnamed Item

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