Minimax problem of suppressing a communication network

DOI10.1134/S0965542521060117zbMath1473.90038OpenAlexW3200599180MaRDI QIDQ822223

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

Publication date: 21 September 2021

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

Full work available at URL: https://doi.org/10.1134/s0965542521060117

zbMATH Keywords

equivalent problems on Boolean latticeFord and Fulkerson maximum flow problemmaximum flow minimization problemreduction of minimax problem to sequence of equivalent problemssubmodular programming techniques

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• Maximal Flow Through a Network
• Constructing Maximal Dynamic Flows from Static Flows
• On network flow functions
• Algorithms for maximization of supermodular functions and their application in the optimization of grouping provinces in a region

This page was built for publication: Minimax problem of suppressing a communication network