Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/62247
Title: Decomposition of basic graphs in fractional linear programming problems with linear constraints
Authors: Pilipchuk L. A.
Keywords: материалы конференций;basis graphs;multiflow programming
Issue Date: 2025
Publisher: БГУИР
Citation: Pilipchuk, L. A. Decomposition of basic graphs in fractional linear programming problems with linear constraints / L. A. Pilipchuk // Информационные технологии и системы 2025 (ИТС 2025) : материалы международной научной конференции, Минск, 19 ноября 2025 / Белорусский государственный университет информатики и радиоэлектроники ; редкол.: Л. Ю. Шилин [и др.]. – Минск, 2025. – С. 185–186.
Abstract: Efficient computational technologies of decomposing basis graphs in linear-fractional multiflow programming problems with a nested constraint structure are considered. An example of basis graphs decomposition for solving large sparse linear systems for mathematical model of one linear-fractional programming problem are given.
URI: https://libeldoc.bsuir.by/handle/123456789/62247
Appears in Collections:ИТС 2025

Files in This Item:
File Description SizeFormat 
Pilipchuk_Decomposition.pdf2.37 MBAdobe PDFView/Open
Show full item record Google Scholar

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