A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem.

Isma Bentoumi Fabio Furini Ali Ridha Mahjoub Sébastien Martin

Published in: CoDIT (2023)

Keyphrases

maximum flow
minimum cut
directed graph
min cut max flow
directed networks
special case
minimum cost
graph partitioning
decomposition method
benders decomposition
push relabel