Two-Commodity Flow
From MaRDI portal
Publication:4170247
DOI10.1145/322092.322100zbMath0388.68054MaRDI QIDQ4170247
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322092.322100
68Q25: Analysis of algorithms and problem complexity
90C05: Linear programming
90B10: Deterministic network models in operations research
05C38: Paths and cycles
05C20: Directed graphs (digraphs), tournaments
68W99: Algorithms in computer science
Related Items
The complexity of linear programming, The complexity of bottleneck labeled graph problems, The biobjective undirected two-commodity minimum cost flow problem, A new strategy for the undirected two-commodity maximum flow problem, On the hardness of finding near-optimal multicuts in directed acyclic graphs, Multicommodity flows in tree-like networks, Simple and improved parameterized algorithms for multiterminal cuts, Combinatorial analysis (nonnegative matrices, algorithmic problems), Algorithms and complexity analysis for some flow problems, Max-balanced flows in oriented matroids, On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles., Computing the throughput of a network with dedicated lines, A constrained matching problem, An exponential (matching based) neighborhood for the vehicle routing problem, Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs, On unicyclic graphs with uniquely restricted maximum matchings, Synthesis of directed multicommodity flow networks, Partitioning trees: Matching, domination, and maximum diameter, A Representation of bipartite graphs by digraphs and its programming application, NP-Complete operations research problems and approximation algorithms
