A combinatorial branch-and-bound algorithm for box search

Considering a set of points in a multi-dimensional space with an associated real value for each point, we want to find the box with the maximum sum of the values of the included points.
This problem has applications in data mining and can be formulated as a mixed-integer linear program.
We propose a branch-and-bound algorithm where the bounding is obtained by combinatorial arguments instead of the traditional linear relaxation.
Computational experiments show that this approach competes with current state of the art mixed-integer solvers.
The algorithm proposed in this paper may be seen as a simple and dependence-free method to solve the box search problem.