A decomposition algorithm for optimality problems in tree-structured networks
From MaRDI portal
Publication:1214853
DOI10.1016/0012-365X(73)90048-4zbMath0298.90058MaRDI QIDQ1214853
Publication date: 1973
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Algebraic Methods Applied to Network Reliability Problems ⋮ Projections in minimax algebra ⋮ Finding a bounded mixed-integer solution to a system of dual network inequalities ⋮ Semirings and path spaces ⋮ Decomposition algorithms for locating minimal cuts in a network
Cites Work
- Unnamed Item
- Unnamed Item
- The Use of Linear Graphs in Gauss Elimination
- A Decomposition Algorithm for Shortest Paths in a Network
- The Extension of the Cascade Algorithm to Large Graphs
- Shortcut in the Decomposition Algorithm for Shortest Paths in a Network
- An Algebra for Network Routing Problems
- Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network
