We characterize all numbers n and S with the following property: Every instance of the partition problem that consists of n positive integers with sum S possesses a solution, that is, a partition into two subsets with equal sum. (C) 2006 Published by Elsevier Ltd
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
最適化：モデリングとアルゴリズム９In this paper we propose a new algorithm for solving the subset-sum problem. First ...
Consider any set U = un with elements defined by un+2= un+2 + un, n ⩾ 1, where u1 and u2 are relativ...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
AbstractWe characterize all numbers n and S with the following property: Every instance of the parti...
AbstractMacMahon [Combinatory Analysis, vols. I and II, Cambridge University Press, Cambridge, 1915,...
A partition is a way that a number can be written as a sum of other numbers. For example, the number...
summary:Let $S$ be a non-empty subset of positive integers. A partition of a positive integer $n$ ...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
最適化：モデリングとアルゴリズム９In this paper we propose a new algorithm for solving the subset-sum problem. First ...
Consider any set U = un with elements defined by un+2= un+2 + un, n ⩾ 1, where u1 and u2 are relativ...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
AbstractWe characterize all numbers n and S with the following property: Every instance of the parti...
AbstractMacMahon [Combinatory Analysis, vols. I and II, Cambridge University Press, Cambridge, 1915,...
A partition is a way that a number can be written as a sum of other numbers. For example, the number...
summary:Let $S$ be a non-empty subset of positive integers. A partition of a positive integer $n$ ...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
最適化：モデリングとアルゴリズム９In this paper we propose a new algorithm for solving the subset-sum problem. First ...
Consider any set U = un with elements defined by un+2= un+2 + un, n ⩾ 1, where u1 and u2 are relativ...
DOI
Add to ORKG