Abstract The NP-complete Vertex Cover problem asks to cover all edges of a graph by small (given) number vertices. It is among the most prominent graph-algorithmic problems. Following recent trend in studying temporal graphs (a sequence graphs, so-called layers, over same vertex set but, time, changing edge sets), we initiate study Multistage . Herein, given graph, goal find for each layer and ...

This paper introduces application of Reflexive Game Theory to the matter of multistage decision making processes. The idea behind is that each decision making session has certain parameters like “when the session is taking place”, “who are the group members to make decision”, “how group members influence on each other”, etc. This study illustrates the consecutive or sequential decision making p...

Process flexibility, whereby a production facility can produce multiple products, is a critical design consideration in multiproduct supply chains facing uncertain demand. The challenge is to determine a cost-effective flexibility configuration that is able to meet the demand with high likelihood. In this paper, we present a framework for analyzing the benefits from flexibility in multistage su...

It is shown that the model of twoor multistage programming undi^r risk results from the application of the principle of dynamic planning* in special structured dynamic decision situations under risk. By u ^ing this property, some characteristics of the solution set of dynamic planning problems will be derived. *This principle is well known and discussed as "flexible Planung" in the German manag...