The following pages link to Mehdi Ghiyasvand (Q326492):
Displaying 15 items.
- Finding a contra-risk path between two nodes in undirected graphs (Q326494) (← links)
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
- An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem (Q651729) (← links)
- Solving the minimum flow problem with interval bounds and flows (Q746432) (← links)
- A new algorithm for solving the feasibility problem of a network flow (Q990544) (← links)
- Inverse quickest center location problem on a tree (Q1741512) (← links)
- Solving the absolute 1-center problem in the quickest path case (Q2119314) (← links)
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem (Q2410039) (← links)
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem (Q2424659) (← links)
- A new approach for computing a most positive cut using the minimum flow algorithms (Q2493746) (← links)
- A NEW APPROACH FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH INTERVAL AND FUZZY DATA (Q3005953) (← links)
- A Simple Approximation Algorithm for Computing Arrow-Debreu Prices (Q4904586) (← links)
- Weakly and strongly polynomial algorithms for computing the maximum decrease in uniform arc capacities (Q5279769) (← links)
- (Q5501017) (← links)