Weighted min cost flows

DOI10.1016/0377-2217(82)90113-8MaRDI QIDQ1168883zbMATH OpenOpenAlexFDO

Authors 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

arc capacitiescombinatorial optimizationdirected graphminimal ratio problemsolution proceduresweighted min-cost flow problem

Mathematics Subject Classification ID

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

Cites work

• A characterization of the minimum cycle mean in a digraph
• 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
• scientific article; zbMATH DE number 3465108 (Why is no real title available?)
• scientific article; zbMATH DE number 3235858 (Why is no real title available?)
• scientific article; zbMATH DE number 3302125 (Why is no real title available?)
• scientific article; zbMATH DE number 3302126 (Why is no real title available?)
• scientific article; zbMATH DE number 3313421 (Why is no real title available?)
• Minimal ratio spanning trees
• More pathological examples for network flow problems
• Shortest-path algorithms: Taxonomy and annotation
• Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen

Cited in

(3)

• Decomposition of group flows in regular matroids
• Dominated parasitic flow loops in networks
• A note on weighted minimal cost flows

This page was built for publication: Weighted min cost flows

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