• Solving the minimum flow problem with interval bounds and flows

    • Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/sadh/037/06/0665-0674

    • Keywords

       

      Network flows; minimum flow problem; interval data.

    • Abstract

       

      The minimum cost flow problem with interval data can be solved using two minimum cost flow problems with crisp data. In this paper, the idea of Ghiyasvand was extended for solving the minimum flow problem with interval-valued lower, upper bounds and flows. This problem can be solved using two minimum flow problems with crisp data. Then, this result is extended to networks with fuzzy lower, upper bounds and flows.

    • Author Affiliations

       

      Mehdi Ghiyasvand1

      1. Department of Mathematics, Faculty of Science, Bu-Ali Sina University, Hamedan 65178-38695, Iran
    • Dates

       
  • Sadhana | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2017-2019 Indian Academy of Sciences, Bengaluru.