default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Mehdi Hashemi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j32]Shiva Rahimipour
, Mehdi Ghatee, S. Mehdi Hashemi, Ahmad Nickabadi:
A hybrid of neuro-fuzzy inference system and hidden Markov Model for activity-based mobility modeling of cellphone users. Comput. Commun. 173: 79-94 (2021)
2010 – 2019
- 2016
- [j31]Malihe Niksirat, S. Mehdi Hashemi, Mehdi Ghatee:
Branch-and-price algorithm for fuzzy integer programming problems with block angular structure. Fuzzy Sets Syst. 296: 70-96 (2016) - [c9]Masoud Safilian, S. Mehdi Hashemi, Sepehr Eghbali, Aliakbar Safilian:
An Approximation Algorithm for the Subpath Planning Problem. IJCAI 2016: 669-675 - 2015
- [j30]Shaghayegh Mokarami, S. Mehdi Hashemi:
Constrained shortest path with uncertain transit times. J. Glob. Optim. 63(1): 149-163 (2015) - [j29]Ahmad Moradi, Andrea Lodi, S. Mehdi Hashemi:
Virtual private network design over the first Chvátal closure. RAIRO Oper. Res. 49(3): 569-588 (2015) - 2014
- [j28]Ahmad Moradi, Andrea Lodi, S. Mehdi Hashemi:
On the difficulty of virtual private network instances. Networks 63(4): 327-333 (2014) - [j27]Rasool Tahmasbi, S. Mehdi Hashemi:
Modeling and Forecasting the Urban Volume Using Stochastic Differential Equations. IEEE Trans. Intell. Transp. Syst. 15(1): 250-259 (2014) - 2013
- [j26]Rasool Tahmasbi, Ebrahim Nasrabadi, S. Mehdi Hashemi:
The value of information in stochastic maximum flow problems. Comput. Oper. Res. 40(7): 1744-1751 (2013) - [j25]Andreas Bley, S. Mehdi Hashemi, Mohsen Rezapour:
IP modeling of the survivable hop constrained connected facility location problem. Electron. Notes Discret. Math. 41: 463-470 (2013) - [c8]Andreas Bley, S. Mehdi Hashemi, Mohsen Rezapour:
Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem. TAMC 2013: 72-83 - 2012
- [j24]S. Mehdi Hashemi, Ebrahim Nasrabadi:
On solving continuous-time dynamic network flows. J. Glob. Optim. 53(3): 497-524 (2012) - [c7]Mojtaba Rezvani, S. Mehdi Hashemi:
Enhancing Accuracy of Topic Sensitive PageRank Using Jaccard Index and Cosine Similarity. Web Intelligence 2012: 620-624 - 2011
- [j23]Mohammadreza Jooyandeh, S. Mehdi Hashemi:
Designing an Aspect-Oriented Persistence Layer Supporting Object-Oriented Query Using the .NET Framework 3.5. Comput. Informatics 30(3): 621-637 (2011) - 2010
- [j22]Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay, Maryam Tahmasbi:
Rectangular-radial drawings of cubic plane graphs. Comput. Geom. 43(9): 767-780 (2010) - [j21]S. Mehdi Hashemi, Shaghayegh Mokarami, Ebrahim Nasrabadi:
Dynamic shortest path problems with time-varying costs. Optim. Lett. 4(1): 147-156 (2010) - [j20]Ebrahim Nasrabadi, S. Mehdi Hashemi:
Minimum cost time-varying network flow problems. Optim. Methods Softw. 25(3): 429-447 (2010) - [c6]Maryam Tahmasbi, S. Mehdi Hashemi:
Orthogonal thickness of graphs. CCCG 2010: 199-202
2000 – 2009
- 2009
- [j19]Mahdieh Hasheminezhad, S. Mehdi Hashemi, Maryam Tahmasbi:
Ortho-radial drawings of graphs. Australas. J Comb. 44: 171-182 (2009) - [j18]Mehdi Ghatee, S. Mehdi Hashemi, Masoud Zarepisheh, Esmaile Khorram:
Preemptive priority-based algorithms for fuzzy minimal cost flow problem: An application in hazardous materials transportation. Comput. Ind. Eng. 57(1): 341-354 (2009) - [j17]Mehdi Ghatee, S. Mehdi Hashemi:
Optimal network design and storage management in petroleum distribution network under uncertainty. Eng. Appl. Artif. Intell. 22(4-5): 796-807 (2009) - [j16]Mehdi Ghatee, S. Mehdi Hashemi:
Traffic assignment model with fuzzy level of travel demand: An efficient algorithm based on quasi-Logit formulas. Eur. J. Oper. Res. 194(2): 432-451 (2009) - [j15]Mehdi Ghatee, S. Mehdi Hashemi:
Application of fuzzy minimum cost flow problems to network design under uncertainty. Fuzzy Sets Syst. 160(22): 3263-3289 (2009) - [j14]Mehdi Ghatee, S. Mehdi Hashemi:
Some concepts of the fuzzy multicommodity flow problem and their application in fuzzy network design. Math. Comput. Model. 49(5-6): 1030-1043 (2009) - [c5]Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay:
Spherical-Rectangular Drawings. WALCOM 2009: 345-356 - 2008
- [j13]Mehdi Ghatee, S. Mehdi Hashemi, Behnam Hashemi, Mehdi Dehghan:
The solution and duality of imprecise network problems. Comput. Math. Appl. 55(12): 2767-2790 (2008) - [j12]Ardeshir Dolati, S. Mehdi Hashemi:
On the sphericity testing of single source digraphs. Discret. Math. 308(11): 2175-2181 (2008) - [j11]S. Mehdi Hashemi, Ahmad Moradi, Mohsen Rezapour:
An ACO algorithm to design UMTS access network using divided and conquer technique. Eng. Appl. Artif. Intell. 21(6): 931-940 (2008) - [j10]Ebrahim Nasrabadi, S. Mehdi Hashemi:
Robust Fuzzy Regression Analysis Using Neural Networks. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 16(4): 579-598 (2008) - [c4]Farhad Maleki, Ali Mohades, S. Mehdi Hashemi, Mohammad E. Shiri:
An Image Encryption System by Cellular Automata with Memory. ARES 2008: 1266-1271 - 2007
- [j9]Mehdi Ghatee, S. Mehdi Hashemi:
Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly. Appl. Math. Comput. 188(1): 555-566 (2007) - [j8]S. Mehdi Hashemi, Mohsen Rezapour, Ahmad Moradi:
Two new algorithms for the Min-Power Broadcast problem in static ad hoc networks. Appl. Math. Comput. 190(2): 1657-1668 (2007) - [j7]Ebrahim Nasrabadi, S. Mehdi Hashemi, Mehdi Ghatee:
An LP-Based Approach to Outliers Detection in Fuzzy Regression Analysis. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 15(4): 441-456 (2007) - [j6]Mehdi Ghatee, S. Mehdi Hashemi:
Ranking function-based solutions of fully fuzzified minimal cost flow problem. Inf. Sci. 177(20): 4271-4294 (2007) - [c3]Mohammad A. Tayebi, S. Mehdi Hashemi, Ali Mohades:
B2Rank: An Algorithm for Ranking Blogs Based on Behavioral Features. Web Intelligence 2007: 104-107 - 2006
- [j5]S. Mehdi Hashemi, Maryam Tahmasbi:
A better heuristic for area-compaction of orthogonal representations. Appl. Math. Comput. 172(2): 1054-1066 (2006) - [j4]S. Mehdi Hashemi, Mehdi Ghatee, Ebrahim Nasrabadi:
Combinatorial algorithms for the minimum interval cost flow problem. Appl. Math. Comput. 175(2): 1200-1216 (2006) - [j3]S. Mehdi Hashemi, Mehdi Ghatee, Behnam Hashemi:
Fuzzy goal programming: Complementary slackness conditions and computational schemes. Appl. Math. Comput. 179(2): 506-522 (2006) - [j2]S. Mehdi Hashemi, Mohammad Modarres, Ebrahim Nasrabadi, Mohammad Mehdi Nasrabadi:
Fully fuzzified linear programming, solution and duality. J. Intell. Fuzzy Syst. 17(3): 253-261 (2006) - 2001
- [j1]S. Mehdi Hashemi:
Digraph embedding. Discret. Math. 233(1-3): 321-328 (2001)
1990 – 1999
- 1995
- [c2]S. Mehdi Hashemi, Andrzej Kisielewicz, Ivan Rival:
Upward Drawings on Planes and Speres. GD 1995: 277-286 - 1994
- [c1]S. Mehdi Hashemi, Ivan Rival:
Upward Drawings to Fit Surfaces. ORDAL 1994: 53-58
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
