This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm. Each of these programs is optimized...

A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal quality. We...

A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal quality. We...

A budget-constrained buyer wants to purchase items from a short-listed set. Items are differentiated by observable quality and sellers have private reserve prices for their items. The buyer's problem is to select a subset of maximal quality. Money does not enter the buyer's objective function,...

Assignment type problems consist in optimally assigning or allocating a given set of "activities" to a given set of "resources". Optimisation problems of the assignment type have numerous applications in production planning and logistics. A popular approach to solve such problems or to compute...

Effectiveness in the use of the work force is often the crucial advantage in a company's long-term success over its competitors, especially in technology driven and highly competitive branches as the one considered in this article. While employee scheduling and rostering has been the topic of...