Knapsack Polytope Cutter Initial Release

Dunn, Jack; jackdunnnz;
  • Publisher: Figshare
  • Related identifiers: doi: 10.5281/zenodo.9820
  • Subject: zenodo | binary knapsack | knapsack | Uncategorized

<p>Given a 0-1 single dimension knapsack problem, this algorithm generates the set of cutting planes required to reduce the feasible region of the problem to the convex hull of feasible integer points.</p> <p>See README for more information and instructions.</p>
Share - Bookmark