Two-Commodity Flow
From MaRDI portal
Publication:4170247
DOI10.1145/322092.322100zbMath0388.68054OpenAlexW2052768371MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99)
Related Items (27)
Synthesis of directed multicommodity flow networks ⋮ Max-balanced flows in oriented matroids ⋮ A constrained matching problem ⋮ On unicyclic graphs with uniquely restricted maximum matchings ⋮ Problems hard for treewidth but easy for stable gonality ⋮ Performing Multicut on Walkable Environments ⋮ An exponential (matching based) neighborhood for the vehicle routing problem ⋮ Hardness Results for Structured Linear Systems ⋮ On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. ⋮ The Maximum Flow Problem for Oriented Flows ⋮ Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs ⋮ The complexity of linear programming ⋮ The biobjective undirected two-commodity minimum cost flow problem ⋮ A new strategy for the undirected two-commodity maximum flow problem ⋮ Bottleneck subset-type restricted matching problems ⋮ Simple and improved parameterized algorithms for multiterminal cuts ⋮ On the hardness of finding near-optimal multicuts in directed acyclic graphs ⋮ The complexity of bottleneck labeled graph problems ⋮ Multicommodity flows in tree-like networks ⋮ Computing the throughput of a network with dedicated lines ⋮ Quadratic vertex kernel for rainbow matching ⋮ NP-Complete operations research problems and approximation algorithms ⋮ Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program ⋮ Partitioning trees: Matching, domination, and maximum diameter ⋮ A Representation of bipartite graphs by digraphs and its programming application ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ Algorithms and complexity analysis for some flow problems
This page was built for publication: Two-Commodity Flow
