There is a newer version of the record available.

Published May 14, 2014 | Version v1.0
Software Open

Knapsack Polytope Cutter Initial Release

Authors/Creators

  • 1. University of Auckland

Description

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.

See README for more information and instructions.

Files

knapsack-polytope-cutter-v1.0.zip

Files (9.1 kB)

Name Size Download all
md5:5b58ed7bdb32cf6cb8e5c52373873177
9.1 kB Preview Download

Additional details

Related works

Is supplement to
https://github.com/jackdunnnz/knapsack-polytope-cutter/tree/v1.0 (URL)