CalculatingKth Shortest Paths

From MaRDI portal

Revision as of 04:24, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5666405

Jump to:navigation, search

DOI10.1080/03155986.1973.11731537zbMath0252.90056OpenAlexW2506596302MaRDI QIDQ5666405

No author found.

Publication date: 1973

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)

Related Items (4)

Finding the k shortest paths in parallel ⋮ Shortest-path algorithms: Taxonomy and annotation ⋮ An efficient algorithm for K shortest simple paths ⋮ A dynamic programming algorithm to find all solutions in a neighborhood of the optimum

This page was built for publication: CalculatingKth Shortest Paths

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5666405&oldid=30365638"