Document Type : Research Paper
Authors
1 Department of Mathematics, Balasore College of Engg . & Technology Teach. Sergarh, Balasore , Orissa , India
2 Ms.student of Mathematics, F. M. Autonomous College, Balasore, Orissa, India
3 Department of Mathematics Gurukul Institute of Technology Bhubaneswar, Orissa, India
Abstract
The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality has been presented in this current paper. Such type of facets plays an important role in set covering set partitioning, matroidal-intersection vertex- packing, generalized assignment and other combinatorial problems. Strong covers for facets of Knapsack ploytope has been developed in the first part of the present paper. Generating family of valid cutting planes that satisfy inequality with 0-1 variables through algorithms are the attraction of this paper.
Keywords
Main Subjects
)