Integer equal flows

Authors:
Carol A. Meyers;Andreas S. Schulz
Affiliations:
Lawrence Livermore National Laboratory, L-153, 7000 East Avenue, Livermore, CA 94550, United States;Massachusetts Institute of Technology, E53-357, 77 Massachusetts Avenue, Cambridge, MA 02139, United States
Venue:
Operations Research Letters
Year:
2009

Citing 8
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
On the limits of proper learnability of subclasses of DNF formulas

Machine Learning - Special issue on COLT '94
Algorithms for the Simple Equal Flow Problem

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Theory of Equal-Flows in Networks

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Network Flow Problems in Constraint Programming

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Decoding Turbo-Like Codes via Linear Programming

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A Dynamic Network Flow Problem with Uncertain Arc Capacities: Formulation and Problem Structure

Operations Research

A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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