A family of classes in nested chain abacus and related generating functions

Abacus model has been employed widely to represent partitions for any positive integer. However, no study has been carried out to develop connected beads of abacus in graphical representation for discrete objects. To resolve this connectedness problem this study is oriented in characterising n - connected objects knows as n connected ominoes, which then generate nested chain abacus. Furthermore, the theoretical conceptual properties for the nested chain abacus are being formulated. Along the construction, three different types of transformation are being created that are essential in building a family of classes. To enhance further, based on theses classes, generating functions are also being formulated by employing enumeration of combinatorial objects (ECO). In ECO method, each object is obtained from smaller object by making some local expansions. These local expansions are described in a simple way by a succession rule which can be translated into a function equation for the generating function. In summary, this stud has succeeded in producing novel graphical representation of nested chain abacus, which can be applied in tiling finite grid

Advances and Novel Approaches in Discrete Optimization

Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled ‘Advances and Novel Approaches in Discrete Optimization’. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms