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
A Pesquisa Operacional na busca de eficiência nos serviços públicos e/ou privados ABSTRACT 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(More)
  • 1