Integer equal flows
Name
Schulz_Integer Equal Flows.PDF
Size
143.33 KB
Format
Adobe PDF
Checksum (MD5)
0907b4b54022e064406b92edeb8ea067
Author(s)
Meyers, Carol A.
Schulz, Andreas S.
Date Issued
March 2009
Journal
Operations Research Letters
Publisher
Elsevier Science
Citation
Meyers, Carol A., and Andreas S. Schulz. “Integer equal flows.” Operations Research Letters 37.4 (2009): 245-249. © 2009 Elsevier B.V.
Version
Author's final manuscript
Abstract
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.
MIT Department
Sloan School of Management
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1016/j.orl.2009.03.006
