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.
Fone: 55 - (31) 3409 – 5882
Fax: 55 - (31) 3409 – 5858
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 and Calculus

  • Operations Research

  • Special Issues in Computer Science: Optimization, Algorithms and Applications

Graduate course in Computer Science

  • Integer and Combinatorial Optimization

  • Network Flows

  • Linear and Nonlinear Programming

Selected recent publications (last two years):

  • Optimization and Simulation in Wireless Sensor Networks with multiple mobile sinks, submitted for publication in Networks, April 2009 (co-authors: C.V. Arbex, G.R. Mateus and W.M. Aioffi)

  • The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation. In Press, Discrete Applied Mathematics, January 2009 (co-authors: F. Quintão, G.R. Mateus, A. Lucena).

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

  • Lower and upper bounds for the Degree-Constrained Minimum Spanning Tree Problem (co-authors: A. Lucena), Networks, 50,55-66, 2007.

  • A Hybrid Relax-and-cut/Branch-and-cut algorithm for the Degree-constrained Minimum Spanning Tree Problem, Operations Research, September 2008, under revision, (co-authors: A. Lucena) – available as Technical Report [pdf]

  • Optimal Topology Design of Complex Networks, First IEEE International Workshop on Network Science For Communication Networks, in conjunction with IEEE Infocom 2009 (co-authors: F. Sumika and G.R. Mateus).

  • Algorithms for Improving the Quality of Service in Wireless Networks with Mobile Sinks, MSWIM'08, Vancouver, Canada, 11-th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, Vol. 1, 239-243, 2008 (co-authors: C. Arbex, W.M. Aioffi, G.R. Mateus).

  • Stronger upper and lower bounds for a hard batching problem to feed assembly lines (co-authors: M. de Souza). In: IV Lagos Latin-Amercian Graphs, Algotihms and Optimization Symposium, 2007, Puerto Varas, Chile. Electronic Notes in Discrete Mathematics, 2008, v. 30, p. 159-164.

  • Integer Programming Formulations for the k-Cardinality tree problem (co-authors: F. Quintão e G. R. Mateus). In: IV Lagos Latin-Amercian Graphs, Algotihms and Optimization Symposium, 2007, Puerto Varas, Chile. Electronic Notes in Discrete Mathematics, 2008, v. 30, 225-230.