Title
Exact solution algorithms for the maximum flow problem with additional conflict constraints
Abstract
•Integer programming models for the maximum flow with conflicts problem.•An exact solution algorithm using branch-and-bound.•An exact solution algorithm using Benders Decomposition.•An exact solution algorithm using Russian Doll Search.•Assessments of the solution algorithms on challenging test problems.
Year
DOI
Venue
2020
10.1016/j.ejor.2020.04.001
European Journal of Operational Research
Keywords
DocType
Volume
Combinatorial optimization,Maximum flow,Conflict,branch-and-bound,Benders decomposition,Russian doll search
Journal
287
Issue
ISSN
Citations 
2
0377-2217
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Zeynep Suvak101.35
I. Kuban Altinel215014.60
Necati Aras300.34