Luiz Aizemberg

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we propose a generic branch-and-cut algorithm for a special class of bi-level combinatorial optimization problems. Namely, we study such problems that can be reformulated as bilinear min-max combinatorial optimization problems. We show that the reformulation can be efficiently solved by a branch-and-cut algorithm whose cuts represent the(More)
  • 1