Islamic Azad University, Rasht Branch
Iranian Journal of Optimization
2588-5723
04
1
2010
03
01
Some Results on facets for linear inequality in 0-1 variables
334
349
513965
EN
D.
Sashi Bhusan
Department of Mathematics, Balasore College of Engg . & Technology Teach.
Sergarh, Balasore , Orissa , India
B.
Bagaban
Ms.student of Mathematics, F. M. Autonomous College, Balasore, Orissa, India
J.P.
Tripathy
Department of Mathematics Gurukul Institute of Technology Bhubaneswar,
Orissa, India
Journal Article
2010
08
25
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.
http://ijo.iaurasht.ac.ir/article_513965_d8a1544208a97a02f64de9dc8b38fb3a.pdf