The Roman domination problem is considered. An improvement of two existing Integer Linear Programing (ILP) formulations is proposed and a comparison between the old and new ones is given. Correctness proofs show that improved linear programing formulations are equivalent to the existing ones regardless of the variables relaxation and usage of lesser number of constraints.

appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. one type of scheduling problems is just-in-time (jit) scheduling and in this area, motivated by jit manufacturing, this study investigates a mathematical model for...

It is now generally accepted that the 'central genome dogma' (i.e. a causal chain going from DNA to RNA to proteins and downstream to biological functions) should be replaced by the 'fluid genome dogma', that is, complex feed-forward and feed-back cycles that interconnect organism and environment by epigenomic programing - and reprograming - throughout life and at all levels, sometimes also dow...

C. A. R. Hoare, N. Wirth, E. W. Dijkstra, and some others active in structured programing have described and tacitly recommended a hierarchical accessibility of passed data in structured programing (see for example, References 11 and 26). This fits well, they and others indicate, with both the theory and the practice of structured programing (see for example, References 15, 18, 19, and 25). Thi...

Today using evolutionary programing for solving complex, nonlinear mathematical problems like optimum power flow is commonly in use. These types of problems are naturally nonlinear and the conventional mathematical methods aren’t powerful enough for achieving the desirable results. In this study an Optimum Power Flow problem solved by means of minimization of fuel costs for IEEE 30 buses test s...