The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case