| DC Field | Value | Language |
|---|
| dc.contributor.author | Pilipchuk L. A. | - |
| dc.coverage.spatial | Минск | en_US |
| dc.date.accessioned | 2025-12-02T07:33:42Z | - |
| dc.date.available | 2025-12-02T07:33:42Z | - |
| dc.date.issued | 2025 | - |
| dc.identifier.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. | en_US |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/62247 | - |
| dc.description.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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | БГУИР | en_US |
| dc.subject | материалы конференций | en_US |
| dc.subject | basis graphs | en_US |
| dc.subject | multiflow programming | en_US |
| dc.title | Decomposition of basic graphs in fractional linear programming problems with linear constraints | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | ИТС 2025
|
