Alexandre Salles da Cunha, D.Sc.

 Prof. Adjunto
 Departamento de Ciência da Computação
Instituto de Ciências Exatas
 Universidade Federal de Minas Gerais



Av. Antônio Carlos, 6627
31.270-010
Belo Horizonte - MG, Brazil
ICEx - Instituto de Ciências Exatas, sala 4010.
email: acunha [at] dcc [dot] ufmg [dot] br
 
Education
 
  • Doctor Degree in Systems Engineering and Computing, 
Universidade Federal do Rio de Janeiro, 2006. 
    Thesis: Árvores ótimas em grafos: modelos, algoritmos e aplicações (in Portuguese). 
Advisor: Abilio Lucena. 
Visiting doctorate student at the Center for Operations Research and Econometrics, CORE,
Universitè Catholique de Louvain, Louvain-la-Neuve, Belgium, 2004-2005. 
Advisor: Laurence Wolsey. 
  • Master Degree in Mechanical Engineering, Universidade Federal de Minas Gerais, 2002.
  • B.S Degree in Mechanical Engineering, Universidade Federal de Minas Gerais, 1994.
 
Research – main areas of interest
 


  1. Combinatorial Optimization: Decomposition, Polyhedral Combinatorics.
  1. Mathematical Programming: Linear, Nonlinear, Integer,  Mixed-integer and Dynamic.  
  2. Industrial Applications of Optimization: mainly in Networks, Logistics and Finance.

Lectures

(To get a free copy of slides, lecture notes, etc., you should subscribe to UFMG's LearnLoop System, for the Lecture you are attending, if you are a UFMG student. Otherwise, send me an email requesting the material you are looking for.)

Undergraduate courses in Computer Science, Engineering and Math.

  • Numerical Analysis

  • Operations Research

Graduate School - Computer Science

  • Integer and Combinatorial Optimization

  • Network Flows

  • Linear and Nonlinear Programming

Selected recent publications (past two years):



  • Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in Wireless Sensor Networks, Computer Networks, Volume 55(13), pages 2803-2820, September 2011 (co-authors: W.M. Aioffi, C.A. Valle and G.R. Mateus)

  • Heuristic and exact algorithms for a minmax selective vehicle routing problem. Computers and Operations Research, Volume 38, Issue 7, July 2011, pages 1054-1065 (co-authors: C.A. Valle, L. C. Martinez and G.R. Mateus)

  • The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation. Discrete Applied Mathematics, Volume 158, Issue 12, June 2010, pages 1305-1314, (co-authors: F. Quintão, G.R. Mateus and A. Lucena)

  • A Relax-and-cut algorithm for the Prize-Collecting Steiner Problem in Graphs, Discrete Applied Mathematics, Volume 157, Issue 6, pages 1198-1217, 2009 (co-authors: A. Lucena, N. Maculan e M. Resende).

  • A New Lagrangian based Branch and Bound Algorithm for the 0-1 Knapsack Problem, Electronic Notes in Discrete Mathematics, Volume 36, pages 623-630, 2010. Proceedings of the International Symposium on Combinatorial Optimization, Hammamet, Tunisia. (co-authors: Laura Bahiense, Cid Carvalho de Souza, Abilio Lucena).