Maximum arc-disjoint and node-disjoint flows in two-commodity networks
From MaRDI portal
Publication:1156680
zbMath0468.90020MaRDI QIDQ1156680
Publication date: 1981
Published in: Opsearch (Search for Journal in Brave)
branch-and-bound algorithm; heuristic methods; multi-commodity network; maximum arc-disjoint flows; near-optimum solutions; node-disjoint flows; two-commodity networks
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research