Optimum flows in general communication networks

DOI10.1016/0016-0032(67)90046-4zbMath0203.22402OpenAlexW2048653685MaRDI QIDQ2541470

Kenji Onaga

Publication date: 1967

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(67)90046-4

Related Items (9)

Improving time bounds on maximum generalised flow computations by contracting the network ⋮ A faster combinatorial approximation algorithm for scheduling unrelated parallel machines ⋮ Multi-commodity flow problem on lossy network with partial lane reversals ⋮ A Strongly Polynomial Algorithm for Generalized Flow Maximization ⋮ Unnamed Item ⋮ Parametric maximal flows in generalized networks – complexity and algorithms ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ Optimum flows in general communication networks ⋮ A parametric algorithm for convex cost network flow and related problems

Cites Work

• Optimum flows in general communication networks
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimum flows in general communication networks