This paper addresses the Two-level Storage Location Assignment Problem (TSLAP) for two level low-level picker-to-part warehouses. The first level consists of a forward area from which all picking is done. The second level consists of a reserve storage area, from which the forward area is...

In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on...

This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing <p> Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived <p> from precedence constraints in the Asymmetric Traveling Salesman Problem with Time <p> Windows and to k-path cuts for...</p></p></p>

We present a Dantzig-Wolfe procedure for the ship scheduling problem with flexible cargo sizes. This problem is similar to the well-known pickup and delivery problem with time windows, but the cargo sizes are defined by an interval instead of a fixed value. We show that the introduction of...

This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arbores- cence problem in order to make it solvable in...