A NEW METHOD FINDING THE K-TH BEST PATH IN A GRAPH
From MaRDI portal
Publication:4175586
DOI10.15807/JORSJ.21.469zbMATH Open0393.05034OpenAlexW2556833947MaRDI QIDQ4175586
Publication date: 1979
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.21.469
Deterministic network models in operations research (90B10) Paths and cycles (05C38) Software, source code, etc. for problems pertaining to combinatorics (05-04)
This page was built for publication: A NEW METHOD FINDING THE K-TH BEST PATH IN A GRAPH