Minimum cost flow problem

MaRDI QIDQ4635959zbMATH OpenFDO

Authors Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin, Thomas L. Magnanti

Publication date 23 April 2018

zbMATH Keywords

network flowminimum cost flow problemlarge-scale optimization problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 6863577
• The problem of maximum flow with minimum attainable cost in a network
• scientific article; zbMATH DE number 150473
• Network flow algorithms
• scientific article; zbMATH DE number 147499

Cited in

(7)

• The problem of maximum flow with minimum attainable cost in a network
• Computer Algebra and Geometric Algebra with Applications
• Minimum cost path problems with relays
• Minimum cost multi-product flow lines
• Interactive tool for the successive shortest paths algorithm in solving the minimum cost flow problem
• Minimum flow variation in maximum flows
• Capacity inverse minimum cost flow problem

This page was built for publication: Minimum cost flow problem

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