scientific article; zbMATH DE number 4064732

MaRDI QIDQ3798455zbMATH OpenFDO

Authors Klaus Simon

Publication date 1988

zbMATH Keywords

acyclic digraphmin flownonnegative lower capacitiesunbounded upper capacities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 4079141
• Minimum flows in (s,t) planar networks
• Finding a minimum feedback arc set in reducible flow graphs
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Finding minimum-cost flows by double scaling

Cited in

(13)

• Network reduction for the acyclic constrained shortest path problem
• Minimum transactions problem
• Bounded MSC communication
• A Minimax Arc Theorem for Reducible Flow Graphs
• A min-max relation in flowgraphs
• scientific article; zbMATH DE number 5125120 (Why is no real title available?)
• scientific article; zbMATH DE number 4079141 (Why is no real title available?)
• Transitively reduced and transitively closed event networks
• Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• scientific article; zbMATH DE number 2150421 (Why is no real title available?)
• Minimal equivalent subgraphs containing a given set of arcs
• Capacity-preserving subgraphs of directed flow networks

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