Skip to main content
2 votes

Set covering SOTA methods and benchmarks

The instances from the literature are available here: Note that the set covering problem is a quite fundamental problem that can appear in ...
fontanf's user avatar
  • 2,623
1 vote

Benchmark problems for Benders Decomposition

Some collections of testing instances for Stochastic Programming which can be solved by the Benders Decomposition / L-shaped / SDDP: MSPLib-Library ...
Penghui Guo's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible