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

DOI10.1007/S10589-008-9214-5zbMATH Open1200.90034OpenAlexW2038258041MaRDI QIDQ711380FDOQ711380

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

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

zbMATH Keywords

biobjective two-commodity maximum flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

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

Cited In (3)

• The biobjective undirected two-commodity minimum cost flow problem
• Title not available (Why is that?)
• 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)