This study describes an alternative development of metaheuristic approaches to automate a one dimensional problem. Extensive computational testing is done to demonstrate the effectiveness of the proposed heuristic, a Variable Neighbourhood Search (VNS)-based algorithm. Several heuristics algorithms that have been used for solving the bin packing problem, Exact algorithm, Random Algorithm, First...

For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...

This work explores the influence of motivation on choice behavior in a dynamic decisionmaking environment, where the payoffs from each choice depend on one’s recent choice history. Previous research reveals that participants in a regulatory fit exhibit increased levels of exploratory choice and flexible use of multiple strategies over the course of an experiment. The present study placed promot...

The paper deals with the best unbiased estimators of the blocked compound symmetric covariance structure for m−variate observations over u sites under the assumption of multivariate normality. The free-coordinate approach is used to prove that the quadratic estimation of covariance parameters is equivalent to linear estimation with a properly defined inner product in the space of symmetric matr...

A k-hypertournament is a complete k-hypergraph with each k-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a k-hypertournament, the score si (losing score ri) of a vertex vi is the number of arcs containing vi in which vi is not the last element (in which vi is the last element). The total score of vi is defined as ti = si − ri. In this ...

Taking into account the recent measurements of the branching ratios and CP asymmetries in the B → ππ decays by the BABAR and BELLE collaborations, an amplitude analysis based on the isospin symmetry is reported. These data allow to get an independent determination of the CKM unitarity-triangle angle γ. One of the best-fit solutions gives the range γ = (65 ± 5) • , in excellent agreement with th...

Taking into account the recent measurements of the branching ratios and CP asymmetries in the B → ππ decays by the BABAR and BELLE collaborations, an amplitude analysis based on the isospin symmetry is reported. These data allow to get an independent determination of the CKM unitarity-triangle angle γ. One of the best-fit solutions gives the range γ = (65 ± 5) • , in excellent agreement with th...