Easily computable facets of the knapsack polytope

Easily computable facets of the knapsack polytope

0.00 Avg rating0 Votes
Article ID: iaor1990291
Country: United States
Volume: 14
Issue: 4
Start Page Number: 760
End Page Number: 764
Publication Date: Nov 1989
Journal: Mathematics of Operations Research
Authors:
Abstract:

It is known that facets and valid inequalities for the knapsack polytope P can be obtained by lifting a simple inequality derived from each minimal cover. The paper studies the computational complexity of such lifting. In particular, it shows that the task of computing a lifted facet can be accomplished in O(ns) where s•n is the cardinality of the minimal cover. Also, for a lifted inequality with integer coefficients, the paper shows that the dual tasks of recognizing whether the inequality is valid for P or is a facet of P can be done within the same time bound.

Reviews

Required fields are marked *. Your email address will not be published.