Maximin problem of communication network synthesis

DOI10.1007/S10598-022-09543-4zbMath1502.90041OpenAlexW4229030209MaRDI QIDQ2095994

I. E. Yanochkin, V. E. Reshetov, A. G. Perevozchikov

Publication date: 16 November 2022

Published in: Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10598-022-09543-4

zbMATH Keywords

application of subgradient ascent method to solve maximin problemclassical Ford-Fulkerson maximum flow problemmaximin network-synthesis problem

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cites Work

• Maximal Flow Through a Network
• Constructing Maximal Dynamic Flows from Static Flows
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximin problem of communication network synthesis