We introduce a new class of valid inequalities for the maximum round robin tournament (MRRT) problem. They strengthen the linear relaxation and improve the upper bound. We also answer negatively the question of Briskorn if the optimal objective value of the MRRT problem and that of its...

We address a stochastic multi-period facility location problem with two customer segments, each having distinct service requirements. While customers in one segment receive preferred service, customers in the other segment accept delayed deliveries as long as lateness does not exceed a...

In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We...

E-commerce has experienced a remarkable growth in recent years. This trend is gradually driving retailers to shift from typical warehouse rental contracts with rigid conditions and long-term commitments to flexible alternatives that provide storage space on demand. This strategy gives retailers...

Linear bilevel optimization problems are often tackled by replacing the linear lower-level problem with its Karush–Kuhn–Tucker conditions. The resulting single-level problem can be solved in a branch-and-bound fashion by branching on the complementarity constraints of the lower-level...