فهرست مقالات vertex-packing

• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  1 - Some Results on facets for linear inequality in 0-1 variables
  D. Sashi Bhusan B. Bagaban J.P. Tripathy
  The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a givenlinear inequality has been presented in this current paper. Such type of facetsplays an important role in set covering set partitioning, matroidal-intersectionvertex- packing, generalized a چکیده کامل

  The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a givenlinear inequality has been presented in this current paper. Such type of facetsplays an important role in set covering set partitioning, matroidal-intersectionvertex- packing, generalized assignment and other combinatorial problems.Strong covers for facets of Knapsack ploytope has been developed in the first partof the present paper. Generating family of valid cutting planes that satisfyinequality with 0-1 variables through algorithms are the attraction of this paper. پرونده مقاله