The Maximum Flow Problem for Oriented Flows

DOI10.4230/OASICS.ATMOS.2016.7MaRDI QIDQ5240225zbMATH OpenOpenAlexFDO

Authors Stanley Schade, Martin Strehler

Publication date 24 October 2019

Full work available at URL http://dx.doi.org/10.4230/OASIcs.ATMOS.2016.7

zbMATH Keywords

approximationcontainer logisticstrain routinggraph expansionnetwork flow with orientation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• scientific article; zbMATH DE number 6863577
• The maximum flow problem: A max-preflow approach
• The maximum nearby flow problem
• scientific article; zbMATH DE number 1062936
• The maximum flow problem with conflict and forcing conditions
• A new approach to the maximum-flow problem
• scientific article; zbMATH DE number 3908126
• The maximum concurrent flow problem
• The inverse maximum dynamic flow problem
• A measure-theoretical max-flow problem

Cites work

• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial optimization. Theory and algorithms.
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Feasibility of Two Commodity Network Flows
• Length-bounded cuts and flows
• Maximal Flow Through a Network
• Multi-Commodity Network Flows
• Polynomial-time algorithms for special cases of the maximum confluent flow problem
• The cycle embedding problem
• Two-Commodity Flow

Cited in

(2)

• Graph orientation and flows over time
• scientific article; zbMATH DE number 6863577 (Why is no real title available?)

This page was built for publication: The Maximum Flow Problem for Oriented Flows

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