Integer equal flows
Author(s)Meyers, Carol A.; Schulz, Andreas S.
MetadataShow full item record
The integer equal flow problem is an NP-hard network flow problem, in which all arcs in given sets R1,…,R[subscript ℓ] must carry equal flow. We show that this problem is effectively inapproximable, even if the cardinality of each set R[subscript k] is two. When ℓ is fixed, it is solvable in polynomial time.
DepartmentSloan School of Management
Operations Research Letters
Meyers, Carol A., and Andreas S. Schulz. “Integer equal flows.” Operations Research Letters 37.4 (2009): 245-249. © 2009 Elsevier B.V.
Author's final manuscript