| dc.contributor.author | Meyers, Carol A. | |
| dc.contributor.author | Schulz, Andreas S. | |
| dc.date.accessioned | 2010-05-12T20:20:09Z | |
| dc.date.available | 2010-05-12T20:20:09Z | |
| dc.date.issued | 2009-03 | |
| dc.date.submitted | 2008-08 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/54777 | |
| dc.description.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. | en |
| dc.language.iso | en_US | |
| dc.publisher | Elsevier Science | en |
| dc.relation.isversionof | http://dx.doi.org/10.1016/j.orl.2009.03.006 | en |
| dc.rights | Attribution-Noncommercial-Share Alike 3.0 Unported | en |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en |
| dc.source | Andreas Schulz | en |
| dc.title | Integer equal flows | en |
| dc.type | Article | en |
| dc.identifier.citation | Meyers, Carol A., and Andreas S. Schulz. “Integer equal flows.” Operations Research Letters 37.4 (2009): 245-249. © 2009 Elsevier B.V. | en |
| dc.contributor.department | Sloan School of Management | en_US |
| dc.contributor.approver | Schulz, Andreas S. | |
| dc.contributor.mitauthor | Schulz, Andreas S. | |
| dc.relation.journal | Operations Research Letters | en |
| dc.eprint.version | Author's final manuscript | |
| dc.type.uri | http://purl.org/eprint/type/SubmittedJournalArticle | en |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en |
| dspace.orderedauthors | Meyers, Carol A.; Schulz, Andreas S. | en |
| dc.identifier.orcid | https://orcid.org/0000-0002-9595-459X | |
| mit.license | OPEN_ACCESS_POLICY | en |
| mit.metadata.status | Complete | |
