In this paper, we address a multi-activity tour scheduling problem with time varying demand. The objective is to compute a team schedule for a fixed roster of employees in order to minimize the over-coverage and the undercoverage of different parallel activity demands along a planning horizon of one week. Numerous complicating constraints are present in our problem: all employees are different ...

A 58-year-old male was admitted for catheter ablation of recurrent atrial tachycardia (AT; Fig. 1A) following 4 previous paroxysmal atrial fibrillation (AF) ablation procedures at other centers involving pulmonary vein (PV) isolation and linear ablations, including cavotricuspid isthmus (CTI), left mitral isthmus, left atrial (LA) roof, and LA anterior line connecting mitral annulus with the ro...

The compound La(2)U(2)Se(9) was obtained in high yield from the stoichiometric reaction of the elements in an Sb(2)Se(3) flux at 1123 K. The compound, which crystallizes in a new structure type in space group Pmma of the orthorhombic system, has a three-dimensional structure with alternating U/Se and La/Se layers attached via three independent, infinite polyselenide chains. The U atom has a mon...

jean-jacques rousseau, écrivain illustre et philosophe révolutionnaire de l’âge des lumières, a recouru pendant les dernières années de sa vie à l’écriture des ouvrages autobiographiques. il y refléta le véritable portrait de soi-même grâce à une mémoire encombrée de souvenirs tumultueux. son œuvre autobiographique qui comprend les confessions, les dialogues et les rêveries du promeneur solitai...

Derman, Lieberman and Ross solved the problem of sequentially assigning n components with different reliabilities to a consecutive-2 linear system to maximize the system reliability. Furthermore, they show that the optimal assignment is invariant, i.e., it depends only on the ranking of the component reliabilities, but not their values. We study the same problem for the consecutive-2 circular s...

The problem of task assignment in heterogeneous computing system has been studied for many years with many versions. We consider the problem in which tasks are to be assigned to homogeneous and heterogeneous machines to minimize the sum of the total computation and communication costs. In this paper, we introduce a novel algorithm to solve task assignment problem. It optimizes the assignment of...

A linear forest is a graph that connected components are chordless paths. A linear partition of a graph G is a partition of its edge set into linear forests and la(G) is the minimum number of linear forests in a linear partition. It is well known that la(G) = 2 when G is a cubic graph and Wormald [17] conjectured that if |V (G)| ≡ 0 (mod 4), then it is always possible to find a linear partition...

In 1955. H.W.Huhn published the Hungarian algorithm, the first polynomial-time algorithm for the assignment problem. In the next fifty years assignment problems attracted hundreds of researchers. Their studies accompanied and sometimes anticipated the development of Combinatorial Optimization, producing fundamental contributions to all algorithmic techniques in use nowadays. This talk is based ...

In this paper, Ni/Al and La-Ni/Al catalysts were prepared with a co-impregnation method and employed in carbon dioxide methanation reaction. The catalytic results showed that the catalyst with (10wt.%) of lanthanum and (20wt.%) nickel had the highest activity at low temperatures in CO2 methanation and the La-Ni/Al catalysts changed the reaction path by lowering its activation energy and consequ...

In 1955 H. W. Kuhn published the Hungarian algorithm, the first polynomial-time algorithm for the assignment problem. In the next fifty years assignment problems attracted hundreds of researchers. Their studies accompanied and sometimes anticipated the development of Combinatorial Optimization, producing fundamental contributions to all algorithmic techniques in use nowadays. This talk is based...