An efficient optimal algorithm for the quantity discount problem in material requirement planning. - S. Hamid Mirmohammadi; Shahram Shadrokh; Fereydoon Kianfar (Comput. Oper. Res., 2009)

A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale. - S. Hamid Mirmohammadi; Kourosh Eshghi (Comput. Oper. Res., 2012)

Site dependent vehicle routing problem with soft time window: Modeling and solution approach. - Esmat Zare-Reisabadi; S. Hamid Mirmohammadi (Comput. Ind. Eng., 2015)

An optimal (r, Q) policy in a stochastic inventory system with all-units quantity discount and limited sharable resource. - Shahrzad Tamjidzad; S. Hamid Mirmohammadi (Eur. J. Oper. Res., 2015)

Optimal (r, Q) policy in a stochastic inventory system with limited resource under incremental quantity discount. - Shahrzad Tamjidzad; S. Hamid Mirmohammadi (Comput. Ind. Eng., 2017)

A two-stage heuristic approach for a multi-item inventory system with limited budgetary resource and all-units discount. - Shahrzad Tamjidzad; S. Hamid Mirmohammadi (Comput. Ind. Eng., 2018)

Joint optimization of dynamic pricing and replenishment cycle considering variable non-instantaneous deterioration and stock-dependent demand. - Neda Tashakkor; S. Hamid Mirmohammadi; Mehdi Iranpoor (Comput. Ind. Eng., 2018)

Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount. - Yaser Malekian; S. Hamid Mirmohammadi; Mehdi Bijari (Comput. Oper. Res., 2021)

A solution approach for sponsored search advertising and dynamic pricing for a perishable product and an online retailer with budget constraint. - Shabnam Salehi; S. Hamid Mirmohammadi (Comput. Ind. Eng., 2023)