Mehdi Ghiyasvand

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Minimizing the expense transmission time from the source node to demand nodes Journal of Combinatorial Optimization	2024-05-06	Paper
Solving the absolute 1-center problem in the quickest path case Bulletin of the Iranian Mathematical Society	2022-03-29	Paper
An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem Journal of Combinatorial Optimization	2019-06-25	Paper
Inverse quickest center location problem on a tree Discrete Applied Mathematics	2019-05-03	Paper
A faster strongly polynomial time algorithm to solve the minimum cost tension problem Journal of Combinatorial Optimization	2017-10-17	Paper
Weakly and strongly polynomial algorithms for computing the maximum decrease in uniform arc capacities Yugoslav Journal of Operations Research	2017-07-19	Paper
Finding a contra-risk path between two nodes in undirected graphs Journal of Combinatorial Optimization	2016-10-12	Paper
Solving the minimum flow problem with interval bounds and flows Sādhanā	2015-10-16	Paper
Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs Annals of Operations Research	2015-08-21	Paper
A new polynomial-time implementation of the out-of-kilter algorithm using Minty's lemma	2015-08-10	Paper
A simple approximation algorithm for computing Arrow-Debreu prices Operations Research	2013-01-30	Paper
An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem Theoretical Computer Science	2012-08-09	Paper
An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem Applied Mathematical Modelling	2011-12-18	Paper
A new approach for solving the minimum cost flow problem with interval and fuzzy data International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems	2011-06-10	Paper
A new algorithm for solving the feasibility problem of a network flow Applied Mathematics and Computation	2010-09-01	Paper
A new approach for computing a most positive cut using the minimum flow algorithms Applied Mathematics and Computation	2006-06-16	Paper

Research outcomes over time

This page was built for person: Mehdi Ghiyasvand