scientific article; zbMATH DE number 6863577

MaRDI QIDQ4635958zbMATH OpenFDO

Authors F. Zeynep Sargut, Ravindra K. Ahuja, James B. Orlin, Thomas L. Magnanti

Publication date 23 April 2018

zbMATH Keywords

capacitated networkmaximum flow problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• The maximum concurrent flow problem
• Max concurrent flow problem
• The maximum nearby flow problem
• Maximum flow problem in the distribution network
• The Maximum Flow Problem for Oriented Flows
• The maximum flow problem: A max-preflow approach
• The maximum flow problem with conflict and forcing conditions
• Flow maximization problem as linear programming problem with capacity constraints
• The maximum flow problem with disjunctive constraints

Cited in

(11)

• Maximum concurrent flow with incomplete data
• The maximum flow problem with disjunctive constraints
• scientific article; zbMATH DE number 3908126 (Why is no real title available?)
• Flow maximization problem as linear programming problem with capacity constraints
• Minimum cost flow problem
• Maxstatic sink location problem with capacitated sinks
• The problem of maximum flow with minimum attainable cost in a network
• Playing with the Maximum-Flow Problem
• The Maximum Flow Problem for Oriented Flows
• A maximum flow problem with intermediate node requirements
• The maximum flow problem of uncertain network

This page was built for publication:

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