Rezumat articol ediţie STUDIA UNIVERSITATIS BABEŞ-BOLYAI

În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului.

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.