Improving relaxations for potential-driven network flow problems via acyclic flow orientations

The class of potential-driven network flow problems provides important models for a range of infrastructure networks. For real-world applications, they need to be combined with integer models for switching certain network elements, giving rise to hard-to-solve MINLPs. We observe that on large-scale real-world meshed networks the usually employed relaxations are rather weak due to cycles in the network. We propose acyclic flow orientations as a combinatorial relaxation of feasible solutions of potential-driven flow problems and show how they can be used to strengthen existing relaxations. First computational results indicate that the strengthend model is much tighter than the original relaxation, thus promising a computational advantage.

Citation

ZIB-Report 18-30, Zuse Institute Berlin, Takustra├če 7 14195 Berlin, Juli 2018.

Article

Download

View Improving relaxations for potential-driven network flow problems via acyclic flow orientations