Mohsen Momeni

Learn More
A Hamiltonian path is a path in an undirected graph, which visits each node exactly once and returns to the starting node. Finding such paths in graphs is the Hamiltonian path problem, which is NP-complete. In this paper, for the first time, a comparative study on metaheuristic algorithms for finding the shortest Hamiltonian path for 1071 Iranian cities is(More)
BACKGROUND The purpose of this study was to determine the prevalence and related factors of low birth weight (LBW) in the Southeast of Iran. METHODS This cross-sectional study was carried out in Kerman province. Data were collected from Iranian Maternal and Neonatal Network at public and private hospitals. All live births from March 2014 to March 2015(More)
A Hamiltonian path is a path in an undirected graph, which visits each node exactly once and returns to the starting node. Finding such paths in graphs is the Hamiltonian path problem, which is NP-complete. In this paper, for the first time, a comparative study on metaheuristic algorithms for finding the shortest Hamiltonian path for 1071 Iranian cities is(More)
INTRODUCTION Today, development of professionalism is a critical aim of medical schools. Studies have demonstrated that medical students' perceived level of professionalism is inadequate worldwide. This study aimed to investigate the medical students' perceptions of their colleagues' professional behavior. METHODS This study is a cross-sectional study(More)
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching-based solution approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by(More)
  • 1