A multicriteria optimization approach for maximizing flow in multiterminal networks
Bishwa Raj Adhikaribishwa208@gmail.comDepartment of MathematicsPrithvi Narayan CampusTribhuvan UniversityPokhara, 33700, NepalView full profile → , *Hari Nandan NathCorresponding authorhari672@gmail.comDepartment of MathematicsBhaktapur Multiple CampusTribhuvan UniversityBhaktapur, 44800, NepalView full profile → , Tanka Nath Dhamalatanka.nath.dhamala@gmail.comCentral Department of MathematicsTribhuvan UniversityKathmandu, 44600, NepalView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Mar 2025
- Published Online:
- 06 Jun 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-2120
- Pages:
- 2245–2261
Abstract
Keywords
Subject Classifications
References
[1] D. R. Fulkerson and L. R. Ford, Flows in Networks. Princeton, NJ, USA: Princeton University Press (1962).
[2] D. B. Johnson, “Parallel algorithms for minimum cuts and maximum flows in planar networks,” Journal of the ACM, vol. 34, no. 4, pp. 950–967 (1987).
[3] N. Zadeh, “Theoretical efficiency of the Edmonds–Karp algorithm for computing maximal flows,” Journal of the ACM, vol. 19, no. 1, pp. 184–192 (1972).
[4] Y. Dinitz, “Dinitz algorithm: The original version and Even’s version,” in Theoretical Computer Science: Essays in Memory of Shimon Even. Springer, pp. 218–240 (2006).
[5] R. K. Ahuja and J. B. Orlin, “A capacity scaling algorithm for the constrained maximum flow problem,” Networks, vol. 25, no. 2, pp. 89–98 (1995).
[6] R. Cerulli, M. Gentili, and A. Iossa, “Efficient preflow push algorithms,” Computers and Operations Research, vol. 35, no. 8, pp. 2694–2708 (2008).
[7] E. Minieka, “Maximal, lexicographic, and dynamic network flows,” Operations Research, vol. 21, no. 2, pp. 517–527 (1973).
[8] U. Pyakurel, H. N. Nath, and T. N. Dhamala, “Efficient contraflow algorithms for quickest evacuation planning,” Science China Mathematics, vol. 61, pp. 2079–2100 (2018).
[9] U. Pyakurel and S. Dempe, “Network flow with intermediate storage: Models and algorithms,” SN Operations Research Forum, vol. 1, pp. 1–23 (2020).
[10] U. Pyakurel, D. P. Khanal, and T. N. Dhamala, “Abstract network flows with intermediate storage for evacuation planning,” European Journal of Operational Research, vol. 305, no. 3, pp. 1178–1193 (2023).
[11] T. N. Dhamala, S. Wagle, and U. Pyakurel, “Flowloc problems with maximum excess flow,” Journal of Industrial and Management Optimization, vol. 19, no. 12, pp. 8851–8870 (2023).
[12] T. N. Dhamala, M. C. Adhikari, D. P. Khanal, and U. Pyakurel, “Generalized maximum flow over time with intermediate storage,” Annals of Operations Research, vol. 335, no. 1, pp. 111–134 (Apr. 2024), doi: 10.1007/s10479-023-05773-w.
[13] Y. P. Aneja and K. P. Nair, “Bicriteria transportation problem,” Management Science, vol. 25, no. 1, pp. 73–78 (1979).
[14] S. Gass and T. Saaty, “The computational algorithm for the parametric objective function,” Naval Research Logistics Quarterly, vol. 2, no. 1–2, pp. 39–45 (1955).
[15] V. Chankong and Y. Y. Haimes, Multiobjective Decision Making: Theory and Methodology. New York, USA: Courier Dover Publications (2008).
[16] H. Isermann, “The enumeration of the set of all efficient solutions for a linear multiple objective program,” Journal of the Operational Research Society (formerly Operational Research Quarterly), vol. 28, no. 3, pp. 711–725 (1977), doi: 10.1057/jors.1977.147.
[17] P. Yu and M. Zeleny, “Linear multiparametric programming by multicriteria simplex method,” Management Science, vol. 23, no. 2, pp. 159–170 (1976).
[18] D. Klingman and J. Mote, “Solution approaches for network flow problems with multiple criteria,” University of Texas at Austin, Austin, TX, USA (1979).
[19] R. Malhotra and M. Puri, “Bicriteria network problem,” Cahiers du Centre d’Études de Recherche Opérationnelle, vol. 26, no. 1–2, pp. 95–102 (1984).
[20] H. Lee and P. S. Pulat, “Bicriteria network flow problem: Continuous case,” European Journal of Operational Research, vol. 51, no. 1, pp. 119–126 (1991).
[21] P. S. Pulat, F. Huarng, and H. Lee, “Efficient solutions for the bicriteria network flow problem,” Computers and Operations Research, vol. 19, no. 7, pp. 649–655 (1992).
[22] H. Lee and P. S. Pulat, “Bicriteria network flow problems: Integer case,” European Journal of Operational Research, vol. 66, no. 1, pp. 148–157 (1993).
[23] H. L. Calvete and P. M. Mateo, “An approach for the network flow with multiple objectives,” Computers and Operations Research, vol. 22, no. 9, pp. 971–983 (1995).
[24] A. Sedeño-Noda and C. González-Martín, “An alternative method to solve the bi-objective minimum cost flow problem,” Asia Pacific Journal of Operational Research, vol. 20, no. 2, pp. 241–260 (2003).
[25] A. Przybylski, X. Gandibleux, and M. Ehrgott, “The bi-objective integer minimum cost flow problem—incorrectness of Sedeño-Noda and González-Martín’s algorithm,” Computers and Operations Research, vol. 33, no. 5, pp. 1459–1470 (2006).
[26] H. W. Hamacher, C. Pedersen, and S. Ruzika, “Multiple objectives minimum cost flow problem: A review,” (2005).
[27] R. M. O’Keefe and J. C. Hayya, “Multicriteria partner selection in virtual organizations with transportation costs and other network interdependencies,” IEEE Transactions on Engineering Management, vol. 52, no. 3, pp. 305–317 (2003).
[28] M. D. J. Sanchez and C. S. Clarke, “An evolutionary multi-objective approach for stochastic air traffic network flow optimization,” in Proc. IEEE Congress on Evolutionary Computation (2015).
[29] K. Tripathi and R. Kumar, “Solving neutrosophic minimal cost flow problem using multi-objective linear programming problem,” Journal of Information & Optimization Sciences, vol. 45, no. 4, pp. 1093–1104 (2024).
[30] P. Liu, “Maximum multicommodity flow problem with local requirement,” IEEE Transactions on Network Science and Engineering (2025).
[31] G. Ruhe, “Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh,” Zeitschrift für Operations Research, vol. 32, no. 1, pp. 9–27 (1988), doi: 10.1007/BF01920568.
[32] A. Eusébio and J. R. Figueira, “Finding non-dominated solutions in bi-objective integer network flow problems,” Computers & Operations Research, vol. 36, no. 9, pp. 2554–2564 (Sep. 2009), doi: 10.1016/j.cor.2008.11.001.
[33] A. Raith and M. Ehrgott, “A two-phase algorithm for the bi-objective integer minimum cost flow problem,” Computers and Operations Research, vol. 36, no. 6, pp. 1945–1954 (2009).
[34] A. Eusébio, J. R. Figueira, and M. Ehrgott, “On finding representative non-dominated points for bi-objective integer network flow problems,” Computers & Operations Research, vol. 48, pp. 1–10 (Aug. 2014), doi: 10.1016/j.cor.2014.02.009.
[35] H. N. Nath, T. N. Dhamala, and S. Dempe, “A bicriteria model for saving a path minimizing the time horizon of a dynamic contraflow,” Computer Sciences & Mathematics Forum, vol. 2, no. 1, Art. no. 2 (Sep. 2021), doi: 10.3390/IOCA2021-10897.
[36] H. N. Nath, S. Dempe, and T. N. Dhamala, “A bicriteria approach for saving a path maximizing dynamic contraflow,” Asia-Pacific Journal of Operational Research, vol. 39, no. 3, Art. no. 2240007 (Jun. 2022), doi: 10.1142/S0217595922400070.
[37] M. Ehrgott, Multicriteria Optimization, 2nd ed., vol. 491, Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, Heidelberg (2005).
[38] D. S. Hochbaum, “Graph Algorithms and Network Flows,” IEOR 266 Lecture Notes, University of California, Berkeley, CA, USA, (2008).
[39] G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York, USA: Wiley-Interscience (1988).
