Logo BSU

Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/220271
Title: Decomposing approach to multi-commodity network flow programming problems
Authors: Pilipchuk, L. A.
Laguto, A. A.
Pilipchuk, A. S.
Issue Date: 2019
Citation: Pilipchuk, L. Decomposing approach to multi-commodity network flow programming problems / L. Pilipchuk, A. Laguto, A. Pilipchuk // Proceeding of the 14th International Conference «Pattern Recognition and Information Proceeding» (PRIP–2019), 21 –23 May 2019, Minsk, Belarusian State University of Informatics and Radioelectronics. – 2019. – P. 328 – 333.
Abstract: We propose the theory of decomposition, methods, technologies, applications and pseudocodes of algorithms for constructing the optimal solution of the inhomogeneous network flow problems.
URI: http://elib.bsu.by/handle/123456789/220271
Appears in Collections:Статьи факультета прикладной математики и информатики

Files in This Item:
File Description SizeFormat 
PRIP2019 Decomposing approach to network.pdf1,28 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.