Optimal resolution sequence of problems modeled by directed graphs

MONTAGNA, J.M.; IRIBARREN, O.A.

MATHEMATICAL AND COMPUTER MODELLING

PERGAMON-ELSEVIER SCIENCE LTD

Año: 1988 vol. 10 p. 515 - 521

0895-7177

Several sciences (engineering, economics etc.) handle problems modeled by directed graphs. The nodes are the sites where the information, transmitted following the arcs, is modified. A formulation to obtain the optimum execution sequence for solving the problem is presented. The constraints requiring that arcs have the same direction as in the actual problem are removed, and the optimal directions for the resolution are the result of an integer linear optimization program. The optimality criterion is to minimize the computer time for the resolution, reducing the iteration levels (inside modules, on recycles, due to optimization loops etc.) of the problem. © 1988.