The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

The bi-dimensional two-way number partitioning problem is a generalization of the classical number partitioning problem, where instead of a set of integers we have a set of vectors of dimension 2 that have to be divided into two subsets so that the sums of the vectors in the subsets are equal or almost equal for both coordinates. This work presents three heuristic algorithms for solving the problem. The algorithms are analyzed, implemented and tested on randomly data instances.

2010 Mathematics Subject Classification. 90C27, 68T15.1998 CR Categories and Descriptors. G.2.1 [Mathematics of Computing]: Discrete mathematics - Combinatorial Algorithms; I.2.8 [Computing Methodologies]: Artificial intelligence - Problem Solving, Control Methods and Search.

Key words and phrases. heuristic algorithms, number partitioning problem, bidimensional two-way number partitioning problem.This paper has been presented at the International Conference KEPT2013: Knowledge Engineering Principles and Techniques, organized by Babeș-Bolyai University, Cluj-Napoca, July 5-7 2013.