Ufdjrw

Why does Carol not get rid of the Kree symbol on her suit when she changes its colours?

Does the reader need to like the PoV character?

How many arrows is an archer expected to fire by the end of the Tyranny of Dragons pair of adventures?

What is the difference between lands and mana?

Does the Linux kernel need a file system to run?

Why can't the Brexit deadlock in the UK parliament be solved with a plurality vote?

Review your own paper in Mathematics

C++ check if statement can be evaluated constexpr

Giving feedback to someone without sounding prejudiced

What is the highest possible scrabble score for placing a single tile

The IT department bottlenecks progress, how should I handle this?

What's the name of the logical fallacy where a debater extends a statement far beyond the original statement to make it true?

How to explain what's wrong with this application of the chain rule?

Microchip documentation does not label CAN buss pins on micro controller pinout diagram

Short story about a deaf man, who cuts people tongues

What is Cash Advance APR?

How to get directions in deep space?

Why do Radio Buttons not fill the entire outer circle?

How to draw a matrix with arrows in limited space

Are Captain Marvel's powers affected by Thanos breaking the Tesseract and claiming the stone?

Taxes on Dividends in a Roth IRA

Biological Blimps: Propulsion

Why should universal income be universal?

Doesn't the system of the Supreme Court oppose justice?

Group students into classes based on friend preferences

Team Building Optimization Using Microsoft Solver Foundation 3.0Friend GroupingAlgorithm for preference based groupingMatching algorithms in R (bipartite matching, Hungarian algorithm)Minimum difference between sum of two numbers in an arraymySQL, grouping data by datePairing students with labsAlgorithm to group people based on their preferenceAlgorithm - group users based on most similar preferencesAlgorithm to find the best assignment of groups and objects with preferred group

1

Every year the teachers at school need to organise student classes for the following year. Students get to select a number of friends they would like to be with (in order). This may vary but is currently limited to six names. School policy is that each student should be with at least one friend - obviously the more preferred that friend is the better. Given N students each with ranked/weighted preferences of class mates, how can they be optimally partitioned into C classes. Other limiting factors would be:

• Class sizes should be as similar as possible


• Sexes should be reasonably evenly distributed

How would any algorithm be modified to include "cannot be with student X" - assuming a large enough negative ranking/weighting may provide this?

It would seem like a problem solved best by a computer thereby freeing up time for more valuable tasks. This isn't a coursework problem, rather a real world issue I would be interested in finding and understanding a solution to. I have found many posts on grouping people by preferred group but not preferred ranked group members.

Please advise if this is the wrong forum.

optimization grouping

share|improve this question

asked Mar 7 at 4:57

MarkMark

353

add a comment | 

1

Every year the teachers at school need to organise student classes for the following year. Students get to select a number of friends they would like to be with (in order). This may vary but is currently limited to six names. School policy is that each student should be with at least one friend - obviously the more preferred that friend is the better. Given N students each with ranked/weighted preferences of class mates, how can they be optimally partitioned into C classes. Other limiting factors would be:

• Class sizes should be as similar as possible


• Sexes should be reasonably evenly distributed

How would any algorithm be modified to include "cannot be with student X" - assuming a large enough negative ranking/weighting may provide this?

It would seem like a problem solved best by a computer thereby freeing up time for more valuable tasks. This isn't a coursework problem, rather a real world issue I would be interested in finding and understanding a solution to. I have found many posts on grouping people by preferred group but not preferred ranked group members.

Please advise if this is the wrong forum.

optimization grouping

share|improve this question

asked Mar 7 at 4:57

MarkMark

353

add a comment | 

Every year the teachers at school need to organise student classes for the following year. Students get to select a number of friends they would like to be with (in order). This may vary but is currently limited to six names. School policy is that each student should be with at least one friend - obviously the more preferred that friend is the better. Given N students each with ranked/weighted preferences of class mates, how can they be optimally partitioned into C classes. Other limiting factors would be:

• Class sizes should be as similar as possible


• Sexes should be reasonably evenly distributed

How would any algorithm be modified to include "cannot be with student X" - assuming a large enough negative ranking/weighting may provide this?

It would seem like a problem solved best by a computer thereby freeing up time for more valuable tasks. This isn't a coursework problem, rather a real world issue I would be interested in finding and understanding a solution to. I have found many posts on grouping people by preferred group but not preferred ranked group members.

Please advise if this is the wrong forum.

optimization grouping

share|improve this question

asked Mar 7 at 4:57

MarkMark

353

share|improve this question

asked Mar 7 at 4:57

MarkMark

353

share|improve this question

asked Mar 7 at 4:57

MarkMark

353

asked Mar 7 at 4:57

MarkMark

353

asked Mar 7 at 4:57

MarkMark

353