Login / Signup
Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem.
Mette Gamst
B. Petersen
Published in:
Eur. J. Oper. Res. (2012)
Keyphrases
</>
maximum flow
computationally expensive
combinatorial optimization
decision making
computational complexity
mathematical model
multi commodity