We propose general separation procedures for generating cuts for the stable set polytope, inspired by a procedure by Rossi and Smriglio and applying a lifting method by Xavier and Campêlo. In contrast to existing cut-generating procedures, ours generate both rank and non-rank valid inequalities, hence they are of a more general nature than existing methods. This is accomplished by iteratively s...

In this article we found the solution of fuzzy linear controlled systemwith fuzzy initial conditions by using -cuts and presentation of numbersin a more compact form by moving to the eld of complex numbers. Next, afuzzy optimal control problem for a fuzzy system is considered to optimize theexpected value of a fuzzy objective function. Based on Pontryagin MaximumPrinciple, a constructive equati...

The aim of the experiment was to determine the effect of different dry matter content and addition of silage inoculant on the ruminal protein degradability. Alfalfa herbage was collected from two cuts and the fresh matter was sampled two times during each cut (with different dry matter content). During the preparation of experimental micro-silages, the chopped forage was treated with a microbia...

We introduce a new way of generating cutting planes of a mixed integer programme by way of taking binary variables. Four binary variables are introduced to form quartic inequalities, which results in a reduced first-level mixed integer programme. A new way of weakening the inequalities is presented. An algorithm to carryout the separation of the inequalities, which are exponential in number, is...

We consider the minimum-cut partitioning of a graph into more than two parts using spectral methods. While there exist well-established spectral algorithms for this problem that give good results, they have traditionally not been well motivated. Rather than being derived from first principles by minimizing graph cuts, they are typically presented without direct derivation and then proved after ...