Login / Signup
The maximum flow problem with disjunctive constraints.
Ulrich Pferschy
Joachim Schauer
Published in:
J. Comb. Optim. (2013)
Keyphrases
</>
disjunctive constraints
reducing the search space
maximum flow
simplex algorithm
constraint satisfaction problems
minimal cost
binary constraints
combinational optimization
constraint logic programming
push relabel
reduce the search space
probabilistic model
upper bound