I'm trying to solve a relaxed network flow problem, where the relaxation discards the bounds constraints on the network flow (as opposed to a pseudoflow, which discards the flow balance constraints). In particular, this means that some flow values on arcs can be negative. I'm aware that a negative flow on an arc is equivalent to a positive flow in the opposite direction, but for the purposes of my problem, I can't make such a transformation.
Is there any standard terminology for such a relaxation, or are there any problems or algorithms that make use of this type of relaxation?