Models and Complexity of Problems of Design and Reconstruction of Telecommunication and Transport Systems

Autor:	F. A. Sharifov, L. F. Hulianytskyi
Rok vydání:	2014
Předmět:	Mathematical optimization General Computer Science business.industry Minimum cut Network synthesis filters Telecommunications business Mathematics Submodular set function
Zdroj:	Cybernetics and Systems Analysis. 50:693-700
ISSN:	1573-8337 1060-0396
DOI:	10.1007/s10559-014-9659-8
Popis:	This article considers network synthesis problems arising in the design and exploitation of telecommunication and transportation systems. A formalization of network synthesis problems on graphs is proposed in which constraints on cut capacities are given and possibilities of failing some network components are taken into account. Approaches to the solution and analysis of the complexity of the considered problems are described.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c14d51a68dcf067efd136c9291309094 https://doi.org/10.1007/s10559-014-9659-8 Zobrazit plný text záznamu Full text from SpringerLink