Отправить статью по E-mail A novel algorithm for solution of a combinatory set partitioning problem
- Авторы: Lyubetsky V.A.1, Seliverstov A.V.1
-
Учреждения:
- Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)
- Выпуск: Том 61, № 6 (2016)
- Страницы: 705-708
- Раздел: 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
Цитировать
Открытый доступ
Доступ предоставлен
Только для подписчиков
Аннотация
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.
Ключевые слова
Об авторах
V. Lyubetsky
Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)
Email: slvstv@iitp.ru
Россия, Bol’shoi Karetnyi per. 19, str. 1, Moscow, 127051
A. Seliverstov
Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)
Автор, ответственный за переписку.
Email: slvstv@iitp.ru
Россия, Bol’shoi Karetnyi per. 19, str. 1, Moscow, 127051
Дополнительные файлы
