Set Covering Packing Partitioning

When the user wants to model or solve set covering, set packing, or set partitioning problems with exact MIP models, the greedy heuristic and its ln(n) guarantee, LP rounding, or Lagrangian-based heuristics in the Caprara-Fischetti-Toth style. Also use when the user mentions "set covering," "set partitioning," "set packing," "crew scheduling," "covering constraint," "winner determination," or when each row must be hit at least once, exactly once, or at most once by selected columns. For pricing the columns of huge set-partitioning masters, see column-generation; for the routes behind those columns, see vehicle-routing-problem.

hajibabaie Updated 18 repo stars

File contents

hajibabaie/combinatorial-optimization-skills commit d195849dc1

Frequently asked questions

npx get-skill add hajibabaie/set-covering-packing-partitioning