A decomposition algorithm for optimality problems in tree-structured networks

DOI10.1016/0012-365X(73)90048-4MaRDI QIDQ1214853zbMATH OpenFDO

Authors Douglas R. Shier

Publication date 1973

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(73)90048-4

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites work

• A Decomposition Algorithm for Shortest Paths in a Network
• An Algebra for Network Routing Problems
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3518535 (Why is no real title available?)
• Shortcut in the Decomposition Algorithm for Shortest Paths in a Network
• Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network
• The Extension of the Cascade Algorithm to Large Graphs
• The Use of Linear Graphs in Gauss Elimination

Cited in

(5)

• Semirings and path spaces
• Algebraic Methods Applied to Network Reliability Problems
• Decomposition algorithms for locating minimal cuts in a network
• Projections in minimax algebra
• Finding a bounded mixed-integer solution to a system of dual network inequalities

This page was built for publication: A decomposition algorithm for optimality problems in tree-structured networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1214853)