We describe a branch and bound algorithm for the generalized assignment problem in which bounds are obtained from a Lagrangian relaxation with the multipliers set by a heuristic adjustment method. The algorithm was tested on a large sample of small random problems and a number of large problems...

We model a situation in which two retailers consider launching an "Advance Booking Discount" (ABD) program. In this program, customers are enticed to precommit their orders at a discount price prior to the regular selling season. However, these precommitted orders are filled during the selling...

Consider a retailer who sells perishable seasonal products with uncertain demand. Due to the short sales season and long replenishment lead times associated with such products, the retailer is unable to update demand forecasts by using actual sales data generated from the early part of the...