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):



  • Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem, Optimization Letters, , v. 7, p. 1537-1547, 2013 (co-authors: F.Santos and G.R. Mateus)

  • The Pickup and Delivery Problem with Cross-Docking. Computers & Operations Research, v. 40, p. 1085-1093, 2013 (co-authors: F.Santos and G.R. Mateus)

  • Polyhedral Results and Branch-and-cut Algorithm for the K-Cardinality Tree Problem, Mathematical Programming, 2012 (Co-authors: L. Simonetti and A Lucena). In Press.

  • Benders Decomposition, Branch-and-cut and Hybrid Algorithms for the Minimum Connected Dominating Set Problem, INFORMS Journal on Computing, 2013, In Press, (co-authors: B. Gendron, A. Lucena and L. Simonetti)

  • A Branch-and-cut-and-price algorithm for the Two-Echelon Capacitated Vehicle Routing Problem, Transportation Science, 2013, In Press, (co-authors: F.Santos and G.R. Mateus)

  • The Min-Degree Constrained Minimum Spanning Tree Problem: Formulations and Branch-and-cut algorithm. Discrete Applied Mathematics, 2012, In Press, (co-author: L.C. Martinez)

  • A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Tree Problem, ISCO 2012, Lecture Notes in Computer Science 7422, p 237--248 (co-author: L. C. Martinez).

  • 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)