Infinite networks: Minimal cost flows

DOI10.1016/0893-9659(95)00108-5MaRDI QIDQ1921147zbMATH OpenOpenAlexFDO

Authors K. Morisse, Benno Fuchssteiner

Publication date 11 August 1996

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0893-9659(95)00108-5

zbMATH Keywords

disintegration theoryinfinite networksminimal cost flowminimal transportation costs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Flows in infinite networks represented by vector lattices
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• scientific article; zbMATH DE number 997341
• scientific article; zbMATH DE number 1918689
• scientific article; zbMATH DE number 3850794

Cites work

• A unified framework for primal-dual methods in minimum cost network flow problems
• An abstract disintegration theorem
• An efficient implementation of the network simplex method
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3746776 (Why is no real title available?)
• scientific article; zbMATH DE number 3751583 (Why is no real title available?)
• scientific article; zbMATH DE number 53116 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3185418 (Why is no real title available?)
• scientific article; zbMATH DE number 3062453 (Why is no real title available?)

Cited in

(7)

• Flows in infinite networks represented by vector lattices
• scientific article; zbMATH DE number 997341 (Why is no real title available?)
• Cost-volume relationship for flows through a disordered network
• scientific article; zbMATH DE number 3862961 (Why is no real title available?)
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• Inverse optimization in minimum cost flow problems on countably infinite networks
• Duality in convex minimum cost flow problems on infinite networks and hypernetworks

Describes a project that uses

Uses Software

• RelaxIV

This page was built for publication: Infinite networks: Minimal cost flows

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