Title of article :
Well-solvable instances for the partition problem Original Research Article
Author/Authors :
Vladimir G. Deineko، نويسنده , , Gerhard J. Woeginger، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2006
Pages :
4
From page :
1053
To page :
1056
Abstract :
We characterize all numbers nn and SS with the following property: Every instance of the partition problem that consists of nn positive integers with sum SS possesses a solution, that is, a partition into two subsets with equal sum.
Keywords :
Partition problem , Combinatorial optimization , Computational complexity
Journal title :
Applied Mathematics Letters
Serial Year :
2006
Journal title :
Applied Mathematics Letters
Record number :
898237
Link To Document :
بازگشت