The Maximum Flow Problem for Oriented Flows

DOI10.4230/OASIcs.ATMOS.2016.7zbMath1432.90022OpenAlexW2546460648MaRDI QIDQ5240225

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)

Cites Work

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

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