Algorithms for Sorting Subset Sums In this question the number of unique sortings has been discussed.  
As a follow-up, I would like to know, whether the problem of sorting the sequence of subset sums has ever been studied.
There should different algorithms for the case of only positive element-weights and for positive and negative element weights.  
In analogy to the "ordinary" sorting problem, I would expect a variety of solutions to exist, addressing either simplicity of formulation (Bubblesort),
practical applicability (Quicksort) and worst-case optimality (Heapsort).  

Question::
  is there a technical term for the problem and, what would be good ressources for it?

 A: One standard situation where sorted subset sums comes up is in the subset sum problem. (I.e. is zero among the subset sums of a given set?) By splitting the input into two equinumerous subsets, sorting the subset sums of each subset, and comparing the two lists of sorted subset sums, it is possible to solve the problem in time proportional to roughly $2^{n/2}$ (where $n$ is the number of given values) rather than the naive bound of $2^n$.
According to Wikipedia this idea is due to Horowitz and Sahni in 1972; see the link for references.
As for your idea that all-positive should be easier than unconstrained values: I don't think so. If you add the same large value to all inputs, it makes them all positive without changing the solution much (you can decompose the result into a linear number of subsequences within which all sums have been changed in the same way, then merge these subsequences to get the sorted order of your original input, only increasing the complexity by a small amount).
A: After some fruitless efforts to devise a tree-structure based on subset inclusion and after some investigations on the usability of de Bruijn sequences, I finally arrived at a surprisingly simple method, that is also applicable to countably infinite sets of values:  
let $\omega(\sigma)\in\mathbb{R};\ \omega(\emptyset):=0$  the function, that assigns a real weight to each subset.  
let $(\lbrace a_0\rbrace:=\lbrace\emptyset\rbrace,\lbrace a_1\rbrace,\lbrace a_2\rbrace,\ ...\ )$ be the sequence of sets containing as elements the empty set, resp. the elements of the "base set".  
if $(\Omega_{i,0},\ ...\ \Omega_{i,2^{i-1}}) $ denotes the ordered sequence of all subset sums of $(\lbrace a_0\rbrace,\ ...\ \lbrace a_i\rbrace)$
then $(\Omega_{i+1,0},\ ...\ \Omega_{i+1,2^i}) $ is the merge-sorted union
$(\Omega_{i,0},\ ...\ \Omega_{i,2^{i-1}}) \cup (\Omega_{i,0}+\omega(\lbrace a_{i+1}\rbrace),\ ...\ \Omega_{i,2^{i-1}}+\omega(\lbrace a_{i+1}\rbrace)) $  
The sketched algorithm also indicates, that its complexity is $O(2^n)$
if the base set contains $n$ elements. 
If the subset sums are not unique, then duplicates can be skipped without extra effort in the merging process (in that case the index ranges of the sketched algorithm are of course different).   
I'm aware that the notation may need improvement; please feel free to edit or suggest improvements.
