S. Hamid Mirmohammadi

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 7

Top Topics

Quantity Discount

Vehicle Routing

Inventory Replenishment

Sponsored Search Advertising

Top Venues

Comput. Ind. Eng.

Comput. Oper. Res.

Eur. J. Oper. Res.

Publications

Shabnam Salehi, S. Hamid Mirmohammadi
A solution approach for sponsored search advertising and dynamic pricing for a perishable product and an online retailer with budget constraint. Comput. Ind. Eng. 177 (2023)
Yaser Malekian, S. Hamid Mirmohammadi, Mehdi Bijari
Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount. Comput. Oper. Res. 134 (2021)
Neda Tashakkor, S. Hamid Mirmohammadi, Mehdi Iranpoor
Joint optimization of dynamic pricing and replenishment cycle considering variable non-instantaneous deterioration and stock-dependent demand. Comput. Ind. Eng. 123 (2018)
Shahrzad Tamjidzad, S. Hamid Mirmohammadi
A two-stage heuristic approach for a multi-item inventory system with limited budgetary resource and all-units discount. Comput. Ind. Eng. 124 (2018)
Shahrzad Tamjidzad, S. Hamid Mirmohammadi
Optimal (r, Q) policy in a stochastic inventory system with limited resource under incremental quantity discount. Comput. Ind. Eng. 103 (2017)
Esmat Zare-Reisabadi, S. Hamid Mirmohammadi
Site dependent vehicle routing problem with soft time window: Modeling and solution approach. Comput. Ind. Eng. 90 (2015)
Shahrzad Tamjidzad, S. Hamid Mirmohammadi
An optimal (r, Q) policy in a stochastic inventory system with all-units quantity discount and limited sharable resource. Eur. J. Oper. Res. 247 (1) (2015)
S. Hamid Mirmohammadi, Kourosh Eshghi
A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale. Comput. Oper. Res. 39 (7) (2012)
S. Hamid Mirmohammadi, Shahram Shadrokh, Fereydoon Kianfar
An efficient optimal algorithm for the quantity discount problem in material requirement planning. Comput. Oper. Res. 36 (6) (2009)