Minimalistic but functional sample code for grouping teams, as defined by a distance matrix, into k groups of size within min_size to max_size such that the sum of distances of teams within the same group is minimal. The problem is modeled as an integer linear program and solved using Gurobi.
active 2024-06-28 → 2024-08-03 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 37 days from 2024-06-28 to 2024-08-03. Pushes: 1 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| Tobs40 | 1 | 1 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.