A new strategy for the undirected two-commodity maximum flow problem

DOI10.1007/s10589-008-9214-5zbMath1200.90034OpenAlexW2038258041MaRDI QIDQ711380

D. Kharzeev

Publication date: 26 October 2010

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-008-9214-5

zbMATH Keywords

biobjective two-commodity maximum flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal multicut and maximal integer multiflow: a survey
• A two-commodity cut theorem
• Two commodity flows
• Beyond the flow decomposition barrier
• Maximal Flow Through a Network
• A new approach to the maximum-flow problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Two-Commodity Flow
• On Two Commodity Network Flows
• Two commodity network flows and linear programming
• Multi-Commodity Network Flows

This page was built for publication: A new strategy for the undirected two-commodity maximum flow problem