The data transfer problem in a system of systems
We study the problem of transferring a datum from its sources to its recipients. We describe the context of this new problem and we formally define the problem. We show that the problem is polynomially solvable in certain cases. We show that the general problem is strongly NP NP -Hard. We show that 2 related problems of the literature are also strongly NP NP -Hard.
data transfer combinatorial optimization scheduling routing