A novel algorithm for solution of a combinatory set partitioning problem

被引：0

作者：

V. A. Lyubetsky

A. V. Seliverstov

机构：

[1] Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute),

来源：

Journal of Communications Technology and Electronics | 2016年 / 61卷

关键词：

partitioning algorithm; cubic form; computational complexity;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：705 / 708

页数：3

共 50 条

[1] A novel algorithm for solution of a combinatory set partitioning problem
Lyubetsky, V. A.
Seliverstov, A. V.
JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS, 2016, 61 (06) : 705 - 708
[2] ALGORITHM FOR SET PARTITIONING PROBLEM
GONDRAN, M
LAURIERE, JL
REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1974, 8 (NV1): : 27 - 40
[3] Genetic algorithm for the set partitioning problem
Levine, David M.
Australian Electronics Engineering, 1994, 27 (02):
[4] ALGORITHM FOR COMPLETE SET PARTITIONING PROBLEM
SALKIN, HM
LIN, CH
OPERATIONS RESEARCH, 1975, 23 : B389 - B389
[5] AN EFFICIENT ALGORITHM FOR THE COMPLETE SET PARTITIONING PROBLEM
LIN, CHM
SALKIN, HM
DISCRETE APPLIED MATHEMATICS, 1983, 6 (02) : 149 - 156
[6] A SEQUENTIAL AGGREGATION ALGORITHM FOR THE SET PARTITIONING PROBLEM
NOUH, A
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 1987, 63 (03) : 225 - 232
[7] Novel set partitioning algorithm in image coding
Gan, T
Zhu, WL
2005 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS: VOL 1: COMMUNICATION THEORY AND SYSTEMS, 2005, : 538 - 541
[8] SET-COVERING PROBLEM .2. ALGORITHM FOR SET PARTITIONING
BALAS, E
PADBERG, M
OPERATIONS RESEARCH, 1975, 23 (01) : 74 - 90
[9] A Relax-and-Cut algorithm for the set partitioning problem
Cavalcante, Victor F.
de Souza, Cid C.
Lucena, Abilio
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (06) : 1963 - 1981
[10] ON THE SET-COVERING PROBLEM - 2. AN ALGORITHM FOR SET PARTITIONING.
Balas, Egon
Padberg, Manfred
Operations Research, 1600, 1 (74-90):

← 1 2 3 4 5 →