OPTIMIZATION OF NODE COUPLES IN A GIVEN GRAPH SHOWING COUPLING POSSIBILITIES, WHEREBY THE GRAPH REPRESENTS A TECHNICAL SYSTEM

摘要

Using node label functions instead of labels themselves in a procedure aiming at solving the so-called Steiner-tree problem, for example by a process intended to identify the shorter path in a graph, allows for restrictions, either length or time-frame restrictions, to be taken into account when determining cheaper paths.