Submodular functions in problems of synthesis of networks

DOI10.1023/A:1012746124612MaRDI QIDQ1407173zbMATH OpenOpenAlexFDO

Authors F. A. Sharifov

Publication date 9 September 2003

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1012746124612

zbMATH Keywords

attack problemcut submodular functionminimization of general submodular functionsminimum cutminimum cut problemoptimization problems on graphssubmodular functionsynthesis of networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• On submodular function minimization
• A submodular network simplex method
• Minimizing symmetric submodular functions
• Minimizing a submodular function arising from a concave function
• scientific article; zbMATH DE number 3904328

Cited in

(6)

• On a general framework for network representability in discrete optimization
• Property-preserving subnet reductions for designing manufacturing systems with shared resources
• Realization of set functions as cut functions of graphs and hypergraphs
• Models and complexity of problems of design and reconstruction of telecommunication and transport systems
• Submodular containment is hard, even for networks
• On a general framework for network representability in discrete optimization (extended abstract)

This page was built for publication: Submodular functions in problems of synthesis of networks

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