Maximin problem of communication network synthesis

DOI10.1007/S10598-022-09543-4MaRDI QIDQ2095994zbMATH OpenOpenAlexFDO

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

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

• Constructing maximal dynamic flows from static flows
• scientific article; zbMATH DE number 3972626 (Why is no real title available?)
• scientific article; zbMATH DE number 4063877 (Why is no real title available?)
• scientific article; zbMATH DE number 3532756 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3298488 (Why is no real title available?)
• Maximal Flow Through a Network
• On the submodularity of the profit function in a problem of transport planning

Cited in

(6)

• Solutions to a class of minimax decision problems arising in communication systems
• A minimax assignment problem in treelike communication networks
• A class of problems of optimal net synthesis
• scientific article; zbMATH DE number 558538 (Why is no real title available?)
• Power surplus solutions for weighted hypergraph communication situations
• Minimax problem of suppressing a communication network

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

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