Optimal resolution sequence of problems modelled by directed graphs (Q1112059)

In this paper a new modelling of problems represented by directed graphs is proposed. Presently, most of the existing algorithms work on the assumption that the arc directions in the resolution are same as in the physical or decision-making problem. The new approach distinguishes between actual flow and logical flow, and uses the latter for the resolution. This approach improves both the computational efficiency and the ability to handle design and optimization problems.