scientific article; zbMATH DE number 1766757

DOI10.1016/S0453-4514(00)88759-1zbMath1138.90418OpenAlexW4241959934MaRDI QIDQ4538173

Tatsuo Oyama

Publication date: 11 July 2002

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0453-4514(00)88759-1

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (4)

Applying the shortest-path-counting problem to evaluate the importance of city road segments and the connectedness of the network-structured system ⋮ Application of Path Counting Problem and Survivability Function in Analysis of Social Systems ⋮ Applying path-counting methods for measuring the robustness of the network-structured system ⋮ Optimal design of two road networks based on their properties

This page was built for publication: