A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Convex hulls of superincreasing knapsacks and lexicographic orderings
2016
Discrete Applied Mathematics
We consider bounded integer knapsacks where the weights and variable upper bounds together form a superincreasing sequence. The elements of this superincreasing knapsack are exactly those vectors that are lexicographically smaller than the greedy solution to optimizing over this knapsack. We describe the convex hull of this n-dimensional set with O(n) facets. We also establish a distributive property by proving that the convex hull of <- and >-type superincreasing knapsacks can be obtained by
doi:10.1016/j.dam.2015.08.010
fatcat:lzpvcljrc5bjfgy7pn7fjzbwjm