query: There are r tasks that can be assigned to n people, where there is no limit on the number of tasks that can be assigned to each person.
positive_passages.docid: 155501
positive_passages.text: In dynamic resource allocation r tasks are assigned at random to n computers, with no restriction on the number of jobs per computer
negative_passages.docid: 104603
negative_passages.text: Integer program in which at least one of three inequalities holds
negative_passages.docid: 84910
negative_passages.text: Generate some number of lists of pairs given a list of people
negative_passages.docid: 146204
negative_passages.text: Subsets sharing at most $i$ elements
negative_passages.docid: 115833
negative_passages.text: $m \times n$ persons stand in $m$ rows and $n$ columns
negative_passages.docid: 138893
negative_passages.text: Scheduling a team based activity with 10 different teams and X different games. Every team must meet each other ONCE but never twice,
negative_passages.docid: 15525
negative_passages.text: Can 12 teams in 6 disciplines play 6 rounds without repetition?
negative_passages.docid: 23322
negative_passages.text: Combinatorics Inclusion - Exclusion Principle
negative_passages.docid: 33912
negative_passages.text: Group with 380 elements is not simple.
negative_passages.docid: 146098
negative_passages.text: Number of nonempty subsets of a set with $n$ elements
negative_passages.docid: 14531
negative_passages.text: How group action works.
negative_passages.docid: 13153
negative_passages.text: at least one element fixed by all the group
negative_passages.docid: 133383
negative_passages.text: Word/phrase for a task that must be done in the current sprint
negative_passages.docid: 140563
negative_passages.text: Concrete examples of group actions.
negative_passages.docid: 133327
negative_passages.text: N unlabelled balls in M labeled buckets
negative_passages.docid: 59664
negative_passages.text: Task list and giving custom permissions to task assignee
negative_passages.docid: 11679
negative_passages.text: Selecting a security team that includes at most one of the oldest man or oldest woman