| A new algorithm for solving the feasibility problem of a network flow HS Fathabadi, M Ghiyasvand Applied Mathematics and Computation 192 (2), 429-438, 2007 | 15 | 2007 |
| Inverse quickest center location problem on a tree I Keshtkar, M Ghiyasvand Discrete Applied Mathematics 260, 188-202, 2019 | 13 | 2019 |
| A simple approximation algorithm for computing Arrow-Debreu prices M Ghiyasvand, JB Orlin Operations research 60 (5), 1245-1248, 2012 | 13 | 2012 |
| A new approach for solving the minimum cost flow problem with interval and fuzzy data M Ghiyasvand International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems …, 2011 | 10 | 2011 |
| A new approach for computing a most positive cut using the minimum flow algorithms M Ghiyasvand Applied mathematics and computation 176 (1), 27-36, 2006 | 8 | 2006 |
| An O (m (m+ nlogn) log (nC))-time algorithm to solve the minimum cost tension problem M Ghiyasvand Theoretical Computer Science 448, 47-55, 2012 | 7 | 2012 |
| A polynomial-time implementation of Pla's method to solve the MCT problem M Ghiyasvand Advances in Computational Mathematics and Its Applications 1 (2), 104-109, 2012 | 7 | 2012 |
| Solving the minimum flow problem with interval bounds and flows M Ghiyasvand Sadhana 37, 665-674, 2012 | 4 | 2012 |
| Solving the MCQP, MLT, and MMLT problems and computing weakly and strongly stable quickest paths M Ghiyasvand, A Ramezanipour Telecommunication Systems 68 (2), 217-230, 2018 | 3 | 2018 |
| Solving the absolute 1-center problem in the quickest path case M Ghiyasvand, I Keshtkar Bulletin of the Iranian Mathematical Society 48 (2), 643-671, 2022 | 2 | 2022 |
| Scaling implementation of the tension rectification algorithm to solve the feasible differential problem 888 M Ghiyasvand Scientia Iranica 21 (3), 980-987, 2014 | 2 | 2014 |
| An O (mn log (nU)) time algorithm to solve the feasibility problem M Ghiyasvand Applied mathematical modelling 35 (11), 5276-5285, 2011 | 2 | 2011 |
| An O (| E|) time algorithm to find a bottleneck link in single rate two-pair networks S Ghazvineh, M Ghiyasvand Physical Communication 43, 101191, 2020 | 1 | 2020 |
| A faster strongly polynomial time algorithm to solve the minimum cost tension problem M Ghiyasvand Journal of Combinatorial Optimization 34, 203-217, 2017 | 1 | 2017 |
| Adjusting an infeasible network by minimizing the sum of the violation costs M Ghiyasvand Scientia Iranica 24 (1), 319-329, 2017 | 1 | 2017 |
| A Geometrical Explanation to the Optimality Concept of Minimum Cost Flows M Ghiyasvand Scientia Iranica 23 (6), 3063-3071, 2016 | 1 | 2016 |
| Finding a contra-risk path between two nodes in undirected graphs M Ghiyasvand, I Keshtkar Journal of Combinatorial Optimization 32, 917-926, 2016 | 1 | 2016 |
| Upper bounds for the min–max and min–sum cost online problems in wireless ad hoc networks M Ghiyasvand, I Keshtkar Wireless Networks 21 (3), 757-768, 2015 | 1 | 2015 |
| A new polynomial-time implementation of the out-of-kilter algorithm using Minty’s lemma M Ghiyasvand Control and Cybernetics 43 (1), 79--94, 2014 | 1 | 2014 |
| Minimizing the expense transmission time from the source node to demand nodes M Ghiyasvand, I Keshtkar Journal of Combinatorial Optimization 47 (3), 47, 2024 | | 2024 |
