A complete anytime algorithm for number partitioning
Artificial Intelligence
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
The Differencing Method of Set Partitioning
The Differencing Method of Set Partitioning
Joint co-clustering: Co-clustering of genomic and clinical bioimaging data
Computers & Mathematics with Applications
On similarity and inclusion measures between type-2 fuzzy sets with an application to clustering
Computers & Mathematics with Applications
Computers & Mathematics with Applications
Path relinking approach for multiple allocation hub maximal covering problem
Computers & Mathematics with Applications
Genetic algorithm for text clustering based on latent semantic indexing
Computers & Mathematics with Applications
Priority-based target coverage in directional sensor networks using a genetic algorithm
Computers & Mathematics with Applications
Computers & Mathematics with Applications
Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
Computers and Operations Research
| Hi-index | 0.09 |
This paper introduces a multidimensional generalization of the two-way number partitioning problem, as well as an integer linear programming formulation of the problem. There are n binary variables and 2p constraints. The numerical experiments are made on a randomly generated set. In view of its integer linear programming formulation, tests are run in CPLEX. This NP-hard problem uses a set of vectors rather than a set of numbers. The presented experimental results indicate that the generalized problem is much harder than the initial problem.