Databases
StackOverflow2013
Postsdbo
POAn algorithm to sort a list of values into n groups so that the sum of each group is as close as possible
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POAn algorithm to sort a list of values into n groups so that the sum of each group is as close as possible
    primarykey
    data
    text
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USCyborg771
    1. USCyborg771
    plurals
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POAn algorithm to sort a list of values into n groups so that the sum of each group is as close as possible
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POAn algorithm to sort a list of values into n groups so that the sum of each group is as close as possible
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POAn algorithm to sort a list of values into n groups so that the sum of each group is as close as possible
      1. USphilonous
      1. VTFavorite
    1. COIsn't this a variation of the subset-sum problem and potentially not computable in polynomial time?
      singulars
      1. POAn algorithm to sort a list of values into n groups so that the sum of each group is as close as possible
      1. USsc_ray
    2. CONice problem, although proposing a solution is difficult because the criteria for a "good" solution can be defined in many different ways (and since a perfect solution might not exist, you need to define a measure of quality). For example, if I come up with n-1 buckets that are all equal but the last bucket is WAY off, is that better than n/2 buckets that are all different, but within a fixed known bound of each other?
      singulars
      1. POAn algorithm to sort a list of values into n groups so that the sum of each group is as close as possible
      1. USdavin
    3. COI think it's actually (a generalization of) the partition problem, https://secure.wikimedia.org/wikipedia/en/wiki/Partition_problem
      singulars
      1. POAn algorithm to sort a list of values into n groups so that the sum of each group is as close as possible
      1. USFred Foo
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload