Title of article
Some Results on facets for linear inequality in 0-1 variables
Author/Authors
Bhusan ، Das Sashi - Balasore College of Engineering Technology , Bagaban ، Biswal Fakir Mohan Autonomous College , Tripathy ، J.P. - Gurukul Institute of Technology
Pages
12
From page
292
To page
303
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
Convex , hull , set , covering , set , partitioning , Matrodial , intersection , vertex , packing , cutting , planes
Journal title
Iranian Journal of optimization
Serial Year
2012
Journal title
Iranian Journal of optimization
Record number
2475263
Link To Document