Population based metaheuristics, such as hybrid genetic algorithms or memetic algorithms, play an important role in the solution of combinatorial optimization problems. The memetic algorithm presented here for the no-wait flowshop scheduling problem addresses a hierarchically organized complete ternary tree to represent the population that putted together with a recombination plan resembles a p...

The vertex cover problem Find a set of vertices that cover the graph LP rounding is a 4 step scheme to approximate combinatorial problems with theoretical guarantees on solution quality. Several problems in machine learning, computer vision and data analysis can be formulated using NP-­‐hard combinatorial optimization problems. In many of these applications, approximate solutions for these NP-­...

A novel strategy for efficient synthesis of various substituted heterocycles as kinase-directed combinatorial libraries is described. The general scheme involves capture of various dichloroheterocycles onto solid support and further elaborations by aromatic substitution with amines at elevated temperature or by anilines, boronic acids, and phenols via palladium-catalyzed cross-coupling reaction...

The survey methodological paper addresses a glance to a general decision support platform technology for modular systems (modular/composite alterantives/solutions) in various applied domains. The decision support platform consists of seven basic combinatorial engineering frameworks The following is described: (1) general scheme of the decision support platform technology; (2) brief descriptions...

In this paper we investigate combinatorial properties and constructions of two recent topics of cryptographic interest namely frameproof codes for digital ngerprinting and traceability schemes for broadcast encryption We rst give combinatorial descriptions of these two objects in terms of set systems and also discuss the Hamming distance of frameproof codes when viewed as error correcting codes...

In this paper we study the moments of polynomials from Askey scheme, and focus on Askey-Wilson polynomials. More precisely, give a combinatorial proof for case where $d=0$. Their values have already been computed by Kim Stanton in 2015, however, is not completely combinatorial, which means that an explicit bijection has exhibited yet. work, use new approach simpler Al-Salam-Carlitz, using sign ...

let $r$ be an infinite ring. here we prove that if $0_r$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin x}$ for every infinite subset $x$ of $r$, then $r$ satisfies the polynomial identity $x^n=0$. also we prove that if $0_r$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in x}$ for every infinite subset $x$ of $r$, then $x^n=x$ for all $xin r$.

We present an FPTAS for a combinatorial optimization problem which is motivated by a problem in drug-design. The problem is as follows. One is given two finite subsets A,B of points in three-dimensional space which represent the centers of atoms of two molecules. The objective function is large if there are an appropriate rigid motion M , subsets S ⊂ A and T ⊂ B of the same size and a bijective...

In broadcast networks, it is often required to encrypt data so that only a privileged set of users with access to the session key can access the data. The standard technique of transferring the session key to each user individually does not scale with the number of users typically found on a network such as cable. This method is not only time-wise inefficient, but also incurs high communication...