We consider the facility location problem of installing a refueling and recharging infrastructure for vehicles with a strongly limited driving range. For this purpose, a novel problem formulation is introduced that is based on an analogy to the well-known duality relationship of Max Flow and Min Cut. In order to optimally solve this problem, a decomposition-based Branch&Cut approach is developed that iteratively generates violated inequalities and so-called zero-half-cuts as specific cutting planes. A comprehensive computational study on two real-world road networks reveals that this considerable tightening of partial problems in each node enables an efficient enumeration process whereby even large scale instances are solved to optimality for the first time.