The well-known middle levels conjecture asserts that for every integer $n\geq 1$, all binary strings of length 2(n+1) with exactly n+1 many 0s and 1s can be ordered cyclically so any two consecutive differ in swapping the first bit a complementary at some later position. In his book Art Computer Programming, Knuth raised stronger form this (Problem 56 section 7.2.1.3), which requires sequence p...

Within the framework of mathematical theory conflicts, we consider a multi-criterial conflict situation using example child–parent conflict. A general method for constructing diagram is described and possible ways conflicting parties influencing each other in this are discussed. We introduce criteria that characterize intensity conflicts show resolution problem can be reduced to combinatorial o...

the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...