A variant selection problem for a generalized decision network

The problem of alternative selection of a variant is one of the main problems of network project control and scheduling. This paper introduces a concept of the generalized decision network, i.e., a network containing both control alternative nodes and control alternative sets, which generalizes the previously suggested models. The NP-hardness of the optimal variant selection problem for the generalized decision network is proved and an enumeration sieve-type algorithm exactly solving this problem is constructed. A numerical example is given.