Weighted min cost flows

DOI10.1016/0377-2217(82)90113-8zbMath0493.90034OpenAlexW2088748510MaRDI QIDQ1168883

Helmut Friesdorf, Horst W. Hamacher

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90113-8

zbMATH Keywords

combinatorial optimizationdirected graphsolution proceduresarc capacitiesminimal ratio problemweighted min-cost flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Fractional programming (90C32) Deterministic network models in operations research (90B10)

Related Items (3)

Unnamed Item ⋮ Decomposition of group flows in regular matroids ⋮ A note on weighted minimal cost flows

Cites Work

• A characterization of the minimum cycle mean in a digraph
• Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen
• Shortest-path algorithms: Taxonomy and annotation
• Minimal ratio spanning trees
• More pathological examples for network flow problems
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• An algorithm for finding shortest routes from all source nodes to a given destination in general networks
• An Efficient Minimal Cost Flow Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weighted min cost flows