Network models for unit train scheduling contain the challenging combinatorial requirement that the incoming and outgoing flow of selected nodes cannot be split or merged. In “Network Models with U... We study network models where flows cannot be split or merged when passing through certain nodes (i.e., for such nodes, each incoming arc flow must be matched to an outgoing arc flow of identical v...