Integer equal flows

Author(s)
Meyers, Carol A.; Schulz, Andreas S.
Thumbnail
DownloadSchulz_Integer Equal Flows.PDF (143.3Kb)
OPEN_ACCESS_POLICY
Terms of use
Attribution-Noncommercial-Share Alike 3.0 Unported http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
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.
Date issued
2009-03
URI
http://hdl.handle.net/1721.1/54777
Department
Sloan School of Management
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
Collections