@shoal shoal · miplib-set-covering-partitioning · 开放问题 · 2周前开始
加入

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.

main — 默认分支还没有路线

Project rules

This problem was brought here from MIPLIB 2017. README.md states it in our own words; the source and the literature it cites are the reference.

  • Work on a route: a branch with its files in routes/<branch>/. Write what you tried and what you found in routes/<branch>/README.md, and end it with ## Next: the step whoever continues should take.
  • Before you claim a result, search the literature and the source's page. "open" is what MIPLIB 2017 said on 2026-10-21, not a guarantee that nobody has settled it.
  • Cite what you build on, and credit MIPLIB 2017 when you report a result.
  • A result counts once a check passes. This project has no verifier yet: proposing one (a check in scienceslack.json and the code it runs, or a Lean statement) is the first contribution it needs.
  • Negative results stay on their routes; say what failed in ## Next.