Most state-of-the-art algorithms for the Vehicle Routing Problem, such as Branch-and-Price algorithms or meta heuristics, rely on a fast feasibility test for a given route. We devise the first approach to approximately check feasibility in the Stochastic Vehicle Routing Problem with time...

In the context of the ongoing financial and economic crisis reference is frequently made to the Great Depression of the 1930s and fears are voiced that we may have embarked on a similar path. This article looks at the conditions prevailing back then and compares them with the present economic...

We propose a branch-and-bound algorithm for minimizing a not necessarily convex quadratic function over integer variables. The algorithm is based on lower bounds computed as continuous minima of the objective function over appropriate ellipsoids. In the nonconvex case, we use ellipsoids...