Mohsen Abdolhosseinzadeh

Research activities

Journal Papers

The distance-based critical node detection in the symmetric travelling salesman problem and its application to improve the approximate solutions Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour (2023)

A lower bound competitive ratio for the online stochastic shortest path problem Mohsen Abdolhosseinzadeh (2022)

A MAS approach for vehicle routing problem Mir Mohammad Alipour, Hojjat Emami, Mohsen Abdolhosseinzadeh (2022)

Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour (2021)

A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour (2020)

A multiagent reinforcement learning algorithm to solve the maximum independent set problem Mir Mohammad Alipour, Mohsen Abdolhosseinzadeh (2020)

A genetic algorithm for the arrival probability in the stochastic networks Gholam Hassan Shirdel, Mohsen Abdolhosseinzadeh (2016)

Conference Papers

Learning 2-opt Algorithm for the Euclidean Symmetric Traveling Salesman Problem Mohsen Abdolhosseinzadeh (2023)

A New Approximation Algorithm for the Symmetric Traveling Salesman Problem Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour, Mahdi Djahangiri (2022)

A 2-Opt Genetic Algorithm for the Symmetric Traveling Salesman Problem Mohsen Abdolhosseinzadeh (2022)

A Markov Chain Monte Carlo Simulated Annealing Algorithm for Path Traveling Salesman Problem Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour (2022)

Markov Chain Anticipatory Heuristic by Simulated Annealing Algorithm for Traveling Salesman Problem Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour (2022)

Distance Based Critical Node in Symmetric Travelling Salesman Problem Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour (2022)

A Hybrid Genetic Algorithm for Improving the Approximate Solutions for Travelling Salesman Problem Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour (2021)

Semidefinite Relaxation for Total Dominating Set Problem Mahdi Djahangiri, Mohsen Abdolhosseinzadeh (2021)

Christofides’ Algorithm for s-t Traveling Salesman Problem in Grid Networks Mohsen Abdolhosseinzadeh, Mahdi Djahangiri (2020)

An Ant Colony Optimization Method for the Constrained Shortest Hamiltonian Path Problem in the Grid networks Mohsen Abdolhosseinzadeh, Mahdi Djahangiri (2019)

Finding weighted MAXCUT in a graph with uncertain weights Mahdi Djahangiri, Mohsen Abdolhosseinzadeh (2019)

The stochastic online shortest path problem in the cyclic and acyclic networks Mohsen Abdolhosseinzadeh, Mahdi Djahangiri (2019)

Integer programming approach for finding maximum weighted stable set with uncertain weight Mahdi Djahangiri, Mohsen Abdolhosseinzadeh (2019)

The on-line shortest path problem and the primal-dual algorithm Mohsen Abdolhosseinzadeh (2018)

The best established connection in the stochastic network of local Markov proccess Gholam Hassan Shirdel, Mohsen Abdolhosseinzadeh (2016)

Constant Competitive Ratios for the Online Stochastic Shortest Path Problem with Available Statistic Information Mohsen Abdolhosseinzadeh, Gholam Hassan Shirdel (2016)

The Arrival Probability in the Stochastic Networks with Discrete Time Markov Chain Mohsen Abdolhosseinzadeh, Gholam Hassan Shirdel (2014)

.row3_default .researchActivities .researchTypeContent { opacity: 1; position: static; height: initial; } .row3_default .researchActivities .researchActivitiesWrapper .researchTypeTitle { visibility: visible; font-family: Arial; font-size: 1.3rem; transition: background-color .5s, color .5s; display: block; float: left; color: rgb(102, 102, 102); background-color: rgb(255, 255, 255); direction: ltr; text-align: left; padding: .5% 2%; cursor: pointer; border-radius: 5%; margin-top: 1%; } .row3_default .researchActivities .researchTypeContent table .Gv-Empty { text-align: left; direction: ltr; }

Executive activities

Dean of Mathematics and Computer Science Department (1401 - 1403)