Skip to main content
SpringerLink
Log in

Flow constrained minimum cost flow problem

  • Theoretical Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

The paper deals with the uncapacitated minimum cost flow problems subject to additional flow constraints whether or not the sum of node capacities is zero. This is a generalization and extension of transportation problems with restrictions on total flow value. The relationship between the desired flow value and the sum of node capacities of source(s) and sink(s) gives rise to the different set of problems. Mathematical models for the various cases are formulated. For each case an equivalent standard minimum cost flow problem (MCFP) is formulated whose optimal solution provides the optimal solution to the original flow constrained problem. The paper not only extends the similar concept of transportation problem to the case of MCFP but also suggests an alternative equivalent formulation. Solving the alternative problem is computationally better in comparison to the formulation analogous to the transportation case. A broad computational comparison is carried out at the end.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E.: Finding minimum-cost flows by double scaling. Math. Program. 53, 243–266 (1992)

    Article  Google Scholar 

  2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall (1993)

  3. Ahuja, R.K., Orlin, J.B., Sechi, G.M., Zuddas, P.: Algorithms for the simple equal flow problem. Manag. Sci. 45, 1440–1455 (1999)

    Article  Google Scholar 

  4. Cruz, F.R.B., Smith, J.M., Mateus, G.R.: Solving to optimality the uncapacitated fixed-charge network flow problem. Comput. Oper. Res. 25(1), 67–81 (1998). doi:10.1016/S0305-0548(97)00035-X

    Google Scholar 

  5. Cruz, F.R.B., Smith, J.M., Mateus, G.R.: Algorithms for a multi-level network optimization problem. Eur. J. Oper. Res. 118(1), 164–180 (1999)

    Article  Google Scholar 

  6. Gupta, A., Puri, M.C.: More-for-less paradox in minimial cost network flow problem. Optimization 33, 167–177 (1995)

    Article  Google Scholar 

  7. Hashemi, S.M., Ghatee, M., Nasrabadi, E.: Combinatorial algorithms for the minimum interval cost flow problem. Appl. Math. Comput. 175(2), 1200–1216 (2006)

    Article  Google Scholar 

  8. Hassin, R.: Minimum cost flow with set constraints. Networks 12, 1–21 (1982)

    Article  Google Scholar 

  9. Khanna, S.: Impact of extra flow in a transportation problem. Indian J. Pure Appl. Math. 13, 656–665 (1982)

    Google Scholar 

  10. Khanna, S., Bakshi, H.C., Puri, M.C.: On controlling flow in transportation problems. In: Scientific Management of Transport Systems, pp. 293–301. North Holland, The Netherlands (1981)

  11. Khanna, S., Puri, M.: Flow constrained transportation problem with mixed type of supply point and destination constraints. Rev. Belge Stat. Inform. Rech. Oper. 23(3), 35–43 (1983)

    Google Scholar 

  12. Khanna, S., Puri, M.: Solving a transportation problem with mixed constraints and a specified transportation flow. Opsearch 20, 16–24 (1983)

    Google Scholar 

  13. Klein, M.: A primal method for minimal cost flows with applications to the assignment and transportation problems. Manag. Sci. 14, 205–220 (1967)

    Article  Google Scholar 

  14. Lin, Y.K.: A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity. Appl. Math. Comput. 183(1), 142–151 (2006)

    Article  Google Scholar 

  15. Mrad, M., M., H.: Optimal solution of the discrete cost multicommodity network design problem. Appl. Math. Comput. 204(2), 745–753 (2002)

    Article  Google Scholar 

  16. Orlin, J.: Genuinely Polynomial Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem. Tech. Rep. 1615-84, Sloan School of Management, MIT (1984)

  17. Orlin, J.B.: On the simplex algorithm for networks and generalized networks. Math. Program. Stud. 24, 166–178 (1985)

    Article  Google Scholar 

  18. Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2), 338–350 (1993)

    Article  Google Scholar 

  19. Orlin, J.B.: A polynomial time primal network simplex algorithm for minimum cost flows. In: SODA ’96: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 474–481. Society for Industrial and Applied Mathematics, Philadelphia, PA (1996)

  20. Orlin, J.B., Plotkin, S.A., Tardos, E.: Polynomial dual network simplex algorithms. Math. Program. 60(3), 255–276 (1993)

    Article  Google Scholar 

  21. Skutella, M.: Approximating the single source unsplittable min-cost flow problem. Math. Program. 91(3), 493–514 (2002)

    Article  Google Scholar 

  22. Thirwani, D., Arora, S., Khanna, S.: An algorithm for solving fixed charge bi-criterion transportation problem with restricted flow. Optimization 40(2), 193–206 (1997)

    Article  Google Scholar 

Download references

Acknowledgement

I dedicate this work to my mentor late Prof M C Puri who introduced this problem to me and I had initial discussion on this with him way back in 2005.

Author information

Authors and Affiliations

  1. Indian Institute of Management, Lucknow, 226013, India

    Sonia

Authors
  1. Sonia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sonia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sonia Flow constrained minimum cost flow problem. OPSEARCH 49, 154–168 (2012). https://doi.org/10.1007/s12597-012-0069-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-012-0069-2

Keywords

Search

Navigation