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

DOI10.1007/S10589-008-9214-5MaRDI QIDQ711380zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The biobjective undirected two-commodity minimum cost flow problem
• scientific article; zbMATH DE number 2094562
• Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm
• An Algorithm for the Maximal Multicommodity Funnel-Node Flow in an Undirected Network
• Optimal Two-commodity Flows with Non-linear Cost Functions

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• A new approach to the maximum-flow problem
• A two-commodity cut theorem
• Beyond the flow decomposition barrier
• Maximal Flow Through a Network
• Minimal multicut and maximal integer multiflow: a survey
• Multi-Commodity Network Flows
• Network flows. Theory, algorithms, and applications.
• On Two Commodity Network Flows
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Two commodity flows
• Two commodity network flows and linear programming
• Two-Commodity Flow

Cited in

(3)

• scientific article; zbMATH DE number 1819779 (Why is no real title available?)
• The biobjective undirected two-commodity minimum cost flow problem
• SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711380)