Мақаланы 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
Қосымша файлдар
