Given a set P of n points in R d , where each point p of P is associated with a weight w(p) (positive or negative), the Maximum-Weight Box problem consists in finding an axis-aligned box B maximizing P p∈B∩P w(p). We ...