We discuss about linear and nonlinear integer reformulation for the maximum capture problem with random utilities.
We strengthen the best-know MILP formulation for this problem.
We present a greedy algorithm to solve a new relaxation of this problem.
We embed these algorithms in a branch-and-bound scheme to solve the integer problem.
We computationally benchmark our algorithm with current MIP and MINLP formulation on a exhaustive dataset.