Mehdi Ghiyasvand

Available identifiers

Publication	Date of Publication	Type
Minimizing the expense transmission time from the source node to demand nodes	2024-05-06	Paper
Solving the absolute 1-center problem in the quickest path case	2022-03-29	Paper
An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem	2019-06-25	Paper
Inverse quickest center location problem on a tree	2019-05-03	Paper
A faster strongly polynomial time algorithm to solve the minimum cost tension problem	2017-10-17	Paper
Weakly and strongly polynomial algorithms for computing the maximum decrease in uniform arc capacities	2017-07-19	Paper
Finding a contra-risk path between two nodes in undirected graphs	2016-10-12	Paper
Solving the minimum flow problem with interval bounds and flows	2015-10-16	Paper
Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs	2015-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q5501017	2015-08-10	Paper
A Simple Approximation Algorithm for Computing Arrow-Debreu Prices	2013-01-30	Paper
An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem	2012-08-09	Paper
An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem	2011-12-18	Paper
A NEW APPROACH FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH INTERVAL AND FUZZY DATA	2011-06-10	Paper
A new algorithm for solving the feasibility problem of a network flow	2010-09-01	Paper
A new approach for computing a most positive cut using the minimum flow algorithms	2006-06-16	Paper

This page was built for person: Mehdi Ghiyasvand