Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
470740 | Computers & Mathematics with Applications | 2010 | 7 Pages |
Abstract
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 nn binary variables and 2p2p 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jelena Kojić,