Email this article A novel algorithm for solution of a combinatory set partitioning problem
- Authors: Lyubetsky V.A.1, Seliverstov A.V.1
-
Affiliations:
- Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)
- Issue: Vol 61, No 6 (2016)
- Pages: 705-708
- Section: Theory and Methods of Information Processing
- URL: https://journals.rcsi.science/1064-2269/article/view/197061
- DOI: https://doi.org/10.1134/S1064226916060152
- ID: 197061
Cite item
Open Access
Access granted
Subscription Access
Abstract
A novel efficient algorithm for solution of the problem of equal partitioning of a set with predefined weights of elements is proposed. The algorithm is based on calculation of a linear group preserving an invariant: the set of zeros of a cubic form. Algorithms for solution of related problems, including the problem of the search for the second solution if the first solution is known, are discussed.
About the authors
V. A. Lyubetsky
Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)
Email: slvstv@iitp.ru
Russian Federation, Bol’shoi Karetnyi per. 19, str. 1, Moscow, 127051
A. V. Seliverstov
Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)
Author for correspondence.
Email: slvstv@iitp.ru
Russian Federation, Bol’shoi Karetnyi per. 19, str. 1, Moscow, 127051
