This paper discusses the graph covering problem in which a set of edges in an edgeand nodeweighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights. In this problem, because of the large integrality gap of a natural linear programming (LP) relaxation, LP rounding algorithms based on the relaxation yield poor performance. Here we propose a stronger LP ...

In this paper, we investigate the weighted tree augmentation problem (TAP), where the goal is to augment a tree with a minimum cost set of edges such that the graph becomes two edge connected. First we show that in weighted TAP, we can restrict our attention to trees which are binary and where all the non-tree edges go between two leaves of the tree. We then give two different top-down coloring...

in this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear bilevel programming (fflblp) problems by representing all the parameters as triangular fuzzy numbers. in the proposed method, the given fflblp problem is decomposed into three crisp linear programming (clp) problems with bounded variables constraints, the three clp problems are solved separately and...

‎we consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals‎. ‎contrary to classical models‎, ‎where parameters can attain any value from the interval domains independently‎, ‎we study problems with linear dependencies between the parameters‎. ‎we present a class of problems that are easily solved by reduction to the classi...

This study proposes a novel technique for solving Linear Programming Problems with triangular fuzzy variables. A modified version of the well-known simplex method and Existing Method Solving Interval problems are used linear programming Furthermore, illustration, some numerical examples one real problem to demonstrate correctness usefulness proposed method. The algorithm is flexible, easy, reas...