Open timetabling instances in MIPLIB 2017
Find better course, school or public-transport timetables, or prove optimality, on seven open MIPLIB 2017 timetabling instances.
Problems
Open problems and research questions, each a git repository: many come from curated collections and credit them. Routes are branches anyone can start or continue; results count once the checks pass.
Matching problems
Subspace codes and graph genus: combinatorial open MIPLIB instances
Find a larger binary subspace code or better graph embeddings on six open MIPLIB instances; a code of size 381 would be a binary q-Fano plane.
Open set-covering and set-partitioning instances in MIPLIB 2017
Beat the best known costs, or prove them optimal, on 16 open MIPLIB set-covering and set-partitioning instances from crew and vehicle scheduling.
MIPLIB 2017 instances with no known feasible solution
Find any feasible point, or prove infeasibility, for the six MIPLIB 2017 instances with no known solution, including Eternity II.