We present an exact and generic method for solving the pricing problem in column generation, termed the tree search pricing algorithm (TSPA) . TSPA explores the space of feasible columns via a search tree and identifies all columns with a reduced-cost value below an adaptive threshold. Inspired...

We consider bilevel optimization problems in which the leader has no or only partial knowledge about the objective function of the follower. The studied setting is a sequential one in which the bilevel game is played repeatedly. This allows the leader to learn the objective function (values) of...

The addition of lower level integrality constraints to a bilevel linear program is known to result in significantly weaker analytical properties. Most notably, the upper level goal function in the optimistic setting lacks lower semicontinuity and the existence of an optimal solution cannot be...

We study the overflowing bin packing problem (OBPP), a recently proposed one-dimensional packing problem with notable conceptual ties to the field of (just-in-time) scheduling. In this scenario, we are required to pack items of known sizes into bins of known capacities so that, in broad terms,...

A variety of approaches has been developed to deal with uncertain optimization problems. Often, they start with a given set of uncertainties and then try to minimize the influence of these uncertainties. The reverse view is to first set a budget for the price one is willing to pay and then find...