Purpose: The time required by the algorithms for general layouts to solve the large-scale two-dimensional cutting problems may become unaffordable. So this paper presents an exact algorithm to solve above problems. Design/methodology/approach: The algorithm uses the dynamic programming algorithm...

Purpose: The time required by the algorithms for general layouts to solve the large-scale two-dimensional cutting problems may become unaffordable. So this paper presents an exact algorithm to solve above problems. Design/methodology/approach: The algorithm uses the dynamic programming algorithm...

В статье предлагается определение конвейерного бизнес-процесса и модель, позволяющая получать вычислимые характеристики конвейера. К таким характеристикам...

Исследованы зависимости между ковариационными матрицами, вычисляемыми в процессе многомерной рекурсии Левинсона. Показано, что учет выявленных взаимосвязей...

The Shapley value assigns, to each game that is adequately represented by its characteristic function, an outcome for each player. An elaboration on the Shapley value that assigns, to characteristic function games, a "partition function" outcome is broadly established and accepted, but...

Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier) and computability. For each such class, we either show...