Alexandre Salles da Cunha


Associate  Professor 


Bolsa produtividade CNPq nível   2


PhD, COPPE/UFRJ, Brasil, 2006

  acunha@dcc.ufmg.br   www
 ICEx/DCC, room 7323, +55 (31) 3409-5882
Research areas

Information extracted from Lattes platform


Last update: 2017/10/04

Degrees

Ph.D. Engenharia de Sistemas e Computação na Universidade Federal do Rio de Janeiro em 2006
M.Sc. Engenharia Mecânica na Universidade Federal de Minas Gerais em 2002
B.Sc. Engenharia Mecânica na Universidade Federal de Minas Gerais em 1994

Current projects

2017 a AtualAlgoritmos para a Resolução de Problemas de Otimização Combinatória
Projeto aprovado para o Edital FAPEMIG 02/2017 - Programa Pesquisador Mineiro PPM XI - Processo CEX PPM 00164/17
Integrantes: Alexandre Salles da Cunha (coordenador).
2015 a AtualJoint Order Batching and Picker Routing Problem in Inventories
In this research project, we plan to investigate order picking problems, i.e., problems related to retrieving products from storage in response to specific customer requests. These are labour and capital intensive problems, responsible for a substantial share of warehouses' operating costs. Two JOBPRP integer programming formulations are presented. For each formulation, we present exact solution algorithms. One of the proposed formulations leads to a Branch-and-price algorithm whose pricing subproblem is a new variant of the Traveling Salesman Problem, named here as the All-or-Nothing Profitable Traveling Salesman Problem (AN-PTSP). We also investigate extensions for JOBPRP, including the integration of other related optimisation problems like packing and client routing, as well as modeling data uncertainty.
Integrantes: Alexandre Salles da Cunha (coordenador), Mateus, Geraldo R., Arbex Valle, Cristiano.
2013 a AtualAlgoritmos para a resoluçào de problemas de otimização combinatória em Telecomunicações, Logística e Teoria dos Jogos (Edital Universal 2013, projeto 4714641/2013-9)
Neste projeto, propomos a investigação de cinco problemas de otimização combinatória que surgem no contexto de aplicações em Telecomunicações, Logística e em suas conexões com Teoria dos Jogos. São eles: O Problema das Árvores Geradoras Completamente Independentes, O Problema do Ciclo Elementar de Custo Mínimo de um Grafo, O Problema do Jogo em uma Árvore Geradora Mínima, O Problema do Jogo de Stackelberg em Árvores Geradoras de Custo Mínimo e o Problema da Árvore Geradora de Grau Completo. Para cada problema destacado, apresentamos formulações de programação inteira e algoritmos de resolução exata baseados nas técnicas de Decomposição de Dantzig-Wolfe, Decomposição de Benders, Relaxação Lagrangeana e Algoritmos de Planos de Corte. A equipe do projeto é formada por pesquisadores de diversas Universidades, bem como por alunos de doutorado do Programa de Pós Graduação em Ciência da Computação da UFMG.
Integrantes: Alexandre Salles da Cunha (coordenador), Abilio Lucena, Geraldo Robson Mateus, Carlos Roberto Venâncio de Carvalho, Fernanda S. H. Souza, Luidi Simonetti, Dilson Lucas Pereira, SANTOS, FERNANDO AFONSO, Vitor A.A. Souza, Vinícius Wellington Coelho de Morais, Rosklin Juliano Chagas.

Current applied research projects

See all projects in Lattes

Recent publications

Articles in journals

Optimally solving the joint order batching and picker routing problem
2017. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH.
Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem
2016. Computational Optimization and Applications.
The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm
2016. Electronic Notes in Discrete Mathematics.
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game
2016. Electronic Notes in Discrete Mathematics.
A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem
2016. Electronic Notes in Discrete Mathematics.
Formulations and exact solution approaches for the degree preserving spanning tree problem
2015. Networks (New York, N.Y. Print).
Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem
2015. Networks (New York, N.Y. Print).
A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
2015. Transportation Science.
Lower Bounds and Exact Algorithms for the Quadratic Minimum Spanning Tree Problem
2015. Computers & Operations Research.
Optimality cuts and a Branch-and-cut algorithm for the K − rooted Mini-Max Spanning Forest Problem
2015. European Journal of Operational Research.
The Min-Degree Constrained Minimum Spanning Tree Problem: Formulations and Branch-and-cut algorithm
2014. Discrete Applied Mathematics.
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
2014. INFORMS Journal on Computing.
Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs
2013. Electronic Notes in Discrete Mathematics.
The Pickup and Delivery Problem with Cross-Docking
2013. Computers & Operations Research.
A Branch-and-price Algorithm for the Multi-Vehicle Covering Tour Problem
2013. Electronic Notes in Discrete Mathematics.
A New Formulation and Computational Results for the Simple Cycle Problem
2013. Electronic Notes in Discrete Mathematics.
Formulating and Solving the Minimum Dominating Cycle Problem
2013. Electronic Notes in Discrete Mathematics.
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method
2013. Electronic Notes in Discrete Mathematics.
A Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem
2013. Optimization Letters (Print).
Polyhedral results and Branch-and-cut algorithm for the k-cardinality tree problem
2013. Mathematical Programming.
Heuristic and exact algorithms for a min-max selective vehicle routing problem
2011. Computers & Operations Research.
A Relax-and-cut algorithm for the Prize-collecting Steiner Problem in Graphs
2009. Discrete Applied Mathematics.

Papers in conferences

Modelos De Otimização Para O Problema De Roteamento De Veículos Com Cross-docking
2010. XL II Simpósio Brasileiro de Pesquisa Operacional. 0
Um Modelo Com Variáveis Indexadas No Tempo Para A Integração Do Dimensionamento De Lotes E Sequenciamento Em Uma Máquina Com Tempos De Preparação
2010. XL II Simpósio Brasileiro de Pesquisa Operacional. 1
On the design of Complex Networks through a Branch-and-price algorithm
2010. Globecom 2010. 2
Um arcabouço Local Branching para Problemas de Otimização Combinatória aplicado ao Problema da Árvore de Custo Mínimo com k arestas
2009. XLI Simposio Brasileiro de Pesquisa Operacional. 3
Optimal Topology Design of Complex Networks
2009. First IEEE International Workshop on Network Science For Communication Networks. 4

Extended abstracts in conferences

Two Dimensional Transient Finite Volume Diffusional Approach to Transport Equations
2001. 24° Congresso Nacional de Matemática Aplicada e Computacional.

Abstracts in conferences

Finding the Maximum Number of Totally Independent Spanning Trees of a graph with a Branch-and-price algorithm
2015. 16-ème ROADEF.
Algorithms for the Multi-period Degree Constrained Minimum Spanning Tree Problem
2012. 2nd International Symposium on Combinatorial Optimization.
EXact Solution Algorithms for Maximum Leaf Spanning Tree and Minimum Connected Dominating Set
2009. 20th International Symposium on Mathematical Programming.
A hybrid Branch-and-cut Relax-and-cut algorithm for the Degree-constrained Minimum Spanning Tree Problem
2006. International Symposium on Mathematical Programming.
A relax and cut algorithm for the Prize Collecting Steiner Problem in Graphs
2003. 18th International Symposium on Mathematical Programming.

See all publications in Lattes

Current students

MS

PhD

Leonardo Conegundes Martinez. Otimização de portfolios intraday. Início: 2016. Universidade Federal de Minas Gerais (Co orientador)
Dilson guimarães. Programação Semidefinida em Otimização Combinatória e Quadrática. Início: 2016. Universidade Federal de Minas Gerais (Orientador principal)
Luis Henrique Costa Bicalho. Otimização de Sistemas Bus Rapid Transit. Início: 2014. Universidade Federal de Minas Gerais (Orientador principal)
Rosklin Juliano Chagas. Árvores Geradoras ótimas multi-período. Início: 2012. Universidade Federal de Minas Gerais (Orientador principal)

See all students in Lattes