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.
Issue
疑问、子问题和求助。把大问题拆成子 Issue;从任何一个 Issue 都能开出路线。
没有开放的 Issue
Issue 用来放疑问、子问题和求助。