Constraint Programming (CP) is a powerful paradigm for solving Combinatorial Problems (generally issued from Decision Making). In CP, Enumeration Strategies are crucial for resolution performances. In this work, we model the known benchmark problems Latin Square, Magic Square and Sudoku as a Constraint Satisfaction Problems. We solve them with Constraint Programming comparing the performance of...

Unmanned aerial vehicle mobile ad hoc networks (UAVMANETs) formed by multi-UAV self-assembling have rapidly developed and been widely used in many industries recent years. However, UAVMANETs suffer from the problems of complicated key negotiations difficult authentication members’ identities during negotiations. To address these problems, this paper simplifies process introducing a Latin square...

The Latin square completion (LSC) problem is an important NP-complete with numerous applications. Given its theoretical and practical importance, several algorithms are designed for solving the LSC problem. In this work, to further improve performance, a fast local search algorithm developed based on three main ideas. Firstly, reduction reasoning technique used reduce scale of space. Secondly, ...

Within the increase of production, growth and technological developments related directly with in world population, demand for both fossil renewable energy sources such as oil, coal, natural gas, nuclear hydraulics is also increasing. Considering coal reserve values, it’s predicted that global production consumption will continue. Although coal-based electricity has decreased Turkey according t...

In this paper we show that properly edge-colored graphs Gwith |V (G)| ≥ 4δ(G) − 3 have rainbow matchings of size δ(G); this gives the best known bound for a recent question of Wang. We also show that properly edge-colored graphs Gwith |V (G)| ≥ 2δ(G) have rainbow matchings of size at least δ(G) − 2δ(G)2/3. This result extends (with a weaker error term) the well-known result that a factorization...

An (m,m,m)-array of order n is an n×n array such that each cell is assigned a set of at most m symbols from {1, . . . , n} such that no symbol occurs more than m times in any row or column. An (m,m,m)-array is called avoidable if there exists a Latin square such that no cell in the Latin square contains a symbol that also belongs to the set assigned to the corresponding cell in the array. We sh...

We derive necessary and sufficient conditions for there to exist a latin square of order n containing two subsquares of order a and b that intersect in a subsquare of order c. We also solve the case of two disjoint subsquares. We use these results to show that: (a) A latin square of order n cannot have more than n m n h / m h subsquares of order m, where h = ⌈(m + 1)/2⌉. Indeed, the number of s...