Integer equal flows

Integer equal flows

0.00 Avg rating0 Votes
Article ID: iaor20102974
Volume: 37
Issue: 4
Start Page Number: 245
End Page Number: 249
Publication Date: Jul 2009
Journal: Operations Research Letters
Authors: ,
Abstract:

The integer equal flow problem is an NP-hard network flow problem, in which all arcs in given sets R1,…,R𝓁, must carry equal flow. We show that this problem is effectively inapproximable, even if the cardinality of each set Rk is two. When 𝓁 is fixed, it is solvable in polynomial time.

Reviews

Required fields are marked *. Your email address will not be published.