Alexandre Salles da Cunha

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 21

Top Topics

Integer Program

Routing Problem

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Publications

Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha
Compact and non-compact formulations for the Dominated Coloring Problem. INOC (2024)
Dilson Lucas Pereira, Dilson Almeida Guimarães, Alexandre Salles da Cunha, Abilio Lucena
Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem. ISCO (2024)
Henrique Favarini Alves da Cruz, Alexandre Salles da Cunha
The Profitable Single Truck and Trailer Routing Problem with Time Windows: Formulation, valid inequalities and branch-and-cut algorithms. Comput. Ind. Eng. 180 (2023)
Alexandre Salles da Cunha
Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem. J. Comb. Optim. 44 (1) (2022)
Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
Exact Solution Algorithms for the Chordless Cycle Problem. INFORMS J. Comput. 34 (4) (2022)
Dilson Almeida Guimarães, Alexandre Salles da Cunha
The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms. Comput. Geom. 97 (2021)
Alexandre Salles da Cunha
Improved Formulations and Branch-and-cut Algorithms for the Angular Constrained Minimum Spanning Tree Problem. CoRR (2020)
Dilson Almeida Guimarães, Alexandre Salles da Cunha, Dilson Lucas Pereira
Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem. Eur. J. Oper. Res. 280 (1) (2020)
Dilson Lucas Pereira, Alexandre Salles da Cunha
Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem. Eur. J. Oper. Res. 284 (2) (2020)
Alexandre Salles da Cunha, Abilio Lucena
Modeling and solving the angular constrained minimum spanning tree problem. Comput. Oper. Res. 112 (2019)
Alexandre Salles da Cunha
Formulation and Branch-and-cut algorithm for the Minimum Cardinality Balanced and Connected Clustering Problem. INOC (2019)
Dilson Lucas Pereira, Alexandre Salles da Cunha
Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem. Comput. Oper. Res. 98 (2018)
Rosklin Juliano Chagas, Cristiano Arbex Valle, Alexandre Salles da Cunha
Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem. Eur. J. Oper. Res. 271 (1) (2018)
Dilson Lucas Pereira, Alexandre Salles da Cunha
Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem. Networks 71 (1) (2018)
Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha
Optimally solving the joint order batching and picker routing problem. CoRR (2017)
Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha
Optimally solving the joint order batching and picker routing problem. Eur. J. Oper. Res. 262 (3) (2017)
Vinicius Morais, Alexandre Salles da Cunha, Philippe Mahey
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game. Electron. Notes Discret. Math. 52 (2016)
Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena
A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 52 (2016)
Abilio Lucena, Luidi Simonetti, Alexandre Salles da Cunha
The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm. Electron. Notes Discret. Math. 52 (2016)
Luis Henrique Bicalho, Alexandre Salles da Cunha, Abilio Lucena
Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem. Comput. Optim. Appl. 63 (3) (2016)
Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha
Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories. ISCO (2016)
Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem. Eur. J. Oper. Res. 246 (2) (2015)
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha
Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem. Networks 65 (4) (2015)
Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena, Bernard Gendron
Formulations and exact solution approaches for the degree preserving spanning tree problem. Networks 65 (4) (2015)
Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha
A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. Transp. Sci. 49 (2) (2015)
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem. Comput. Oper. Res. 63 (2015)
Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. INFORMS J. Comput. 26 (4) (2014)
Alexandre Salles da Cunha, Fernanda Sumika Hojo de Souza
Finding Totally Independent Spanning Trees with Linear Integer Programming. ISCO (2014)
Leonardo Conegundes Martinez, Alexandre Salles da Cunha
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm. Discret. Appl. Math. 164 (2014)
Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
Formulating and Solving the Minimum Dominating Cycle Problem. Electron. Notes Discret. Math. 41 (2013)
Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha
The Pickup and Delivery Problem with Cross-Docking. Comput. Oper. Res. 40 (4) (2013)
Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method. Electron. Notes Discret. Math. 41 (2013)
Ramon Lopes, Vitor A. A. Souza, Alexandre Salles da Cunha
A Branch-and-price Algorithm for the Multi-Vehicle Covering Tour Problem. Electron. Notes Discret. Math. 44 (2013)
Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena
Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem. Math. Program. 142 (1-2) (2013)
Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
A New Formulation and Computational Results for the Simple Cycle Problem. Electron. Notes Discret. Math. 44 (2013)
Fernando Afonso Santos, Alexandre Salles da Cunha, Geraldo Robson Mateus
Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem. Optim. Lett. 7 (7) (2013)
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha
Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs. Electron. Notes Discret. Math. 41 (2013)
Leonardo Conegundes Martinez, Alexandre Salles da Cunha
A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem. ISCO (2012)
Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha
A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking. Electron. Notes Discret. Math. 37 (2011)
Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha
A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking. INOC (2011)
Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem. INOC (2011)
Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm. INOC (2011)
Cristiano Arbex Valle, Leonardo Conegundes Martinez, Alexandre Salles da Cunha, Geraldo Robson Mateus
Heuristic and exact algorithms for a min-max selective vehicle routing problem. Comput. Oper. Res. 38 (7) (2011)
Wagner Moro Aioffi, Cristiano Arbex Valle, Geraldo Robson Mateus, Alexandre Salles da Cunha
Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in Wireless Sensor Networks. Comput. Networks 55 (13) (2011)
Dilson Lucas Pereira, Alexandre Salles da Cunha, Geraldo Robson Mateus
Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem. Electron. Notes Discret. Math. 37 (2011)
Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus, Abilio Lucena
The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation. Discret. Appl. Math. 158 (12) (2010)
Alexandre Salles da Cunha, Laura Bahiense, Abilio Lucena, Cid Carvalho de Souza
A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem. Electron. Notes Discret. Math. 36 (2010)
Leonardo Conegundes Martinez, Alexandre Salles da Cunha
Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm. Electron. Notes Discret. Math. 36 (2010)
Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. Discret. Appl. Math. 157 (6) (2009)
Cristiano Arbex Valle, Alexandre Salles da Cunha, Geraldo Robson Mateus, Leonardo C. Martinez
Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized. Electron. Notes Discret. Math. 35 (2009)
Carla Bechelane, Alexandre Salles da Cunha, Geraldo Robson Mateus
The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks. Electron. Notes Discret. Math. 35 (2009)
Alexandre Salles da Cunha, Maurício Cardoso de Souza
Stronger upper and lower bounds for a hard batching problem to feed assembly lines. Electron. Notes Discret. Math. 30 (2008)
Cristiano Arbex Valle, Alexandre Salles da Cunha, Wagner Moro Aioffi, Geraldo Robson Mateus
Algorithms for improving the quality of service in wireless sensor networks with multiple mobile sinks. MSWiM (2008)
Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus
Integer Programming Formulations for the k-Cardinality Tree Problem. Electron. Notes Discret. Math. 30 (2008)
Alexandre Salles da Cunha, Abilio Lucena
Lower and upper bounds for the degree-constrained minimum spanning tree problem. Networks 50 (1) (2007)
Alexandre Salles da Cunha, Abilio Lucena
Algorithms for the degree-constrained minimum spanning tree problem. Electron. Notes Discret. Math. 19 (2005)