电邮这篇文章 A novel algorithm for solution of a combinatory set partitioning problem
- 作者: Lyubetsky V.1, Seliverstov A.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
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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
