Logic Cuts Generation in a Branch and Cut Framework for Location
In the warehouse location problem, the objective is to choose a set of warehouses of limited capacity so as to serve a set of demand points while minimizing fixed and transport costs. In particular, it includes a knapsack constraint that can be useful for generating simple logical constraints named logic cuts. The logic cuts can be generated in linear time and can be implemented in a branch and cut framework for accelerating the solution of the capacitated warehouse location problems with fixed costs. We use the Hooker algorithm for generating all contiguous t-cuts in every node of the tree and report the experimental results.