Enviar artigo por via de e-mail A novel algorithm for solution of a combinatory set partitioning problem
- Autores: Lyubetsky V.1, Seliverstov A.1
-
Afiliações:
- Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)
- Edição: Volume 61, Nº 6 (2016)
- Páginas: 705-708
- Seção: 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
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Palavras-chave
Sobre autores
V. Lyubetsky
Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)
Email: slvstv@iitp.ru
Rússia, Bol’shoi Karetnyi per. 19, str. 1, Moscow, 127051
A. Seliverstov
Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)
Autor responsável pela correspondência
Email: slvstv@iitp.ru
Rússia, Bol’shoi Karetnyi per. 19, str. 1, Moscow, 127051
