Two commodity network flows and linear programming

DOI10.1007/BF01584644zbMath0255.90013OpenAlexW2046533673MaRDI QIDQ5670422

M. Sakarovitch

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584644

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (10)

Two commodity flows ⋮ Algorithms for multicommodity flows in planar graphs ⋮ Subspaces with well-scaled frames ⋮ Quasi-balanced matrices ⋮ Unnamed Item ⋮ The biobjective undirected two-commodity minimum cost flow problem ⋮ A new strategy for the undirected two-commodity maximum flow problem ⋮ Classification de certaines matrices 0-1 ⋮ Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs ⋮ The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm

Cites Work

• On Two Commodity Network Flows
• Feasibility of Two Commodity Network Flows
• Multi-Commodity Network Flows
• Unnamed Item

This page was built for publication: Two commodity network flows and linear programming