Alexandre Salles da Cunha
Orcid: 0000-0002-9955-5721
According to our database1,
Alexandre Salles da Cunha
authored at least 53 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the 11th International Network Optimization Conference, 2024
2023
The Profitable Single Truck and Trailer Routing Problem with Time Windows: Formulation, valid inequalities and branch-and-cut algorithms.
Comput. Ind. Eng., June, 2023
2022
Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem.
J. Comb. Optim., 2022
2021
The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms.
Comput. Geom., 2021
2020
Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem.
Eur. J. Oper. Res., 2020
Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem.
Eur. J. Oper. Res., 2020
2019
Comput. Oper. Res., 2019
Formulation and Branch-and-cut algorithm for the Minimum Cardinality Balanced and Connected Clustering Problem.
Proceedings of the 9th International Network Optimization Conference, 2019
2018
Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem.
Networks, 2018
Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem.
Eur. J. Oper. Res., 2018
Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem.
Comput. Oper. Res., 2018
2017
Eur. J. Oper. Res., 2017
2016
Electron. Notes Discret. Math., 2016
Electron. Notes Discret. Math., 2016
A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem.
Electron. Notes Discret. Math., 2016
Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem.
Comput. Optim. Appl., 2016
Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
2015
A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem.
Transp. Sci., 2015
Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem.
Networks, 2015
Formulations and exact solution approaches for the degree preserving spanning tree problem.
Networks, 2015
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem.
Eur. J. Oper. Res., 2015
Comput. Oper. Res., 2015
2014
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.
INFORMS J. Comput., 2014
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm.
Discret. Appl. Math., 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
2013
Optim. Lett., 2013
Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem.
Math. Program., 2013
Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs.
Electron. Notes Discret. Math., 2013
Electron. Notes Discret. Math., 2013
Electron. Notes Discret. Math., 2013
Electron. Notes Discret. Math., 2013
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method.
Electron. Notes Discret. Math., 2013
2012
A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
2011
Electron. Notes Discret. Math., 2011
Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem.
Electron. Notes Discret. Math., 2011
Comput. Oper. Res., 2011
Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in Wireless Sensor Networks.
Comput. Networks, 2011
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm.
Proceedings of the Network Optimization - 5th International Conference, 2011
A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking.
Proceedings of the Network Optimization - 5th International Conference, 2011
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011
2010
Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm.
Electron. Notes Discret. Math., 2010
Electron. Notes Discret. Math., 2010
Discret. Appl. Math., 2010
2009
Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized.
Electron. Notes Discret. Math., 2009
Electron. Notes Discret. Math., 2009
Discret. Appl. Math., 2009
2008
Electron. Notes Discret. Math., 2008
Electron. Notes Discret. Math., 2008
Algorithms for improving the quality of service in wireless sensor networks with multiple mobile sinks.
Proceedings of the 11th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2008
2007
Networks, 2007
2005
Electron. Notes Discret. Math., 2005