Minimum and maximum operators are two well-known t-norm and s-norm used frequently in fuzzy systems. In this paper, two different types of fuzzy inequalities are simultaneously studied where the convex combination of minimum and maximum operators is applied as the fuzzy relational composition. Some basic properties and theoretical aspects of the problem are derived and four necessary and suffi...

In this paper we summarize recent results on finding tight semidefinite programming relaxations for the Max-Cut problem and hence tight upper bounds on its optimal value. Our results hold for every instance of Max-Cut and in particular we make no assumptions on the edge weights. We present two strengthenings of the well-known semidefinite programming relaxation of Max-Cut studied by Goemans and...

Resource allocation problems are concerned with the allocation of limited resources among competing agents so as to achieve the best system performances. In systems which serve many users, like in networking, there is a need to respect some fairness rules while looking for the overall efficiency. The so-called Max-Min Fairness is widely used to meet these goals. However, allocating the resource...