@MISC{Lee97onfacets, author = {E. K. Lee}, title = {On Facets of Knapsack Equality Polytopes}, year = {1997} }

Share

OpenURL

Abstract

The 0/1 knapsack equality polytope is, by definition, the convex hull of 0/1 solutions of a single linear equation. A special form of this polytope -- where the defining linear equation has nonnegative integer coefficients and the number of variables having coefficient one exceeds the right-hand-side -- is considered. Equality constraints of this form arose in a real-world application of integer programming to a truck dispatching scheduling problem. Families of facet defining inequalities for this polytope are identified, and complete linear inequality representations are obtained for some classes of polytopes.