Work

On the implementation of algorithms for solving the simplest dynamic problem of optimal set partitioning

Year: 2025

Type: article

Abstract: 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.

Source: Problems of applied mathematics and mathematic modeling

DOI: 10.15421/322407

Authors: E.M. Kiseleva, L.L. Hart, O.O. Kuzenkov, D.V. Zakutnii

Institution: Oles Honchar Dnipro National University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4407639682

FWCI:

Cites:

Cited by:

Related to: 10