Weihong Hu

Decomposition-Based Approximation Algorithms for the One-Warehouse Multi-Retailer Problem with Concave Batch Order Costs

  • Maged M. Dessouky
  • Weihong Hu
  • Alejandro Toriello
  • Zhuoting Yu
    • Categories Approximation Algorithms, Production and Logistics, Supply Chain Management Tags , ,

    We study the one-warehouse multi-retailer (OWMR) problem under deterministic dynamic demand and concave batch order costs, where order batches have an identical capacity and the order cost function for each facility is concave within the batch. Under appropriate assumptions on holding cost structure, we obtain lower bounds via a decomposition that splits the two-echelon problem … Read more

    Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes

  • Daniel Blado
  • Weihong Hu
  • Alejandro Toriello
    • Categories 0-1 Programming, Dynamic Programming Tags , ,

    We consider a version of the knapsack problem in which an item size is random and revealed only when the decision maker attempts to insert it. After every successful insertion the decision maker can choose the next item dynamically based on the remaining capacity and available items, while an unsuccessful insertion terminates the process. We … Read more

    Strategic Health Workforce Planning

  • Weihong Hu
  • Alejandro Toriello
  • Mariel S. Lavieri
  • Xiang Liu
    • Categories Applications - OR and Management Sciences Tags , , ,

    Analysts predict impending shortages in the health care workforce, yet wages for health care workers already account for over half of U.S. health expenditures. It is thus increasingly important to adequately plan to meet health workforce demand at reasonable cost. Using infinite linear programming methodology, we propose an infinite-horizon model for health workforce planning in … Read more