On the implementation of algorithms for solving the simplest dynamic problem of optimal set partitioning
This paper examines an object-oriented approach to the software implementation of al-gorithms for solving the simplest dynamic problem of optimal partitioning of sets. The fo-cus is on organizing the program code by dividing the logic into independent components.This approach ensures modularity, flexibility, and clarity in development, making it easierto adapt the program to new requirements.
Authors
- Liudmyla Hart (ORCID: https://orcid.org/0000-0003-2617-7851)
- Elena M. Kiseleva (ORCID: https://orcid.org/0000-0003-4303-1707)
- Oleksandr Kuzenkov (ORCID: https://orcid.org/0000-0002-6378-7993)
- D.V. Zakutnii
Institutions
- Oles Honchar Dnipro National University (UA)
Publication Details
- Journal
- Problems of applied mathematics and mathematic modeling
- Published
- 2025-02-16
- DOI
- https://doi.org/10.15421/322407
- Primary Topic
- Statistical and Computational Modeling
- Type
- article
- Field-Weighted Citation Impact
- 0.00