Alexandre Salles da Cunha

According to our database1, Alexandre Salles da Cunha authored at least 49 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

Improved Formulations and Branch-and-cut Algorithms for the Angular Constrained Minimum Spanning Tree Problem.
CoRR, 2020

2019
Modeling and solving the angular constrained minimum spanning tree problem.
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
Optimally solving the joint order batching and picker routing problem.
Eur. J. Oper. Res., 2017

2016
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game.
Electron. Notes Discret. Math., 2016

The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm.
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

Lower bounds and exact algorithms for the quadratic minimum spanning tree problem.
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

Finding Totally Independent Spanning Trees with Linear Integer Programming.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem.
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

A New Formulation and Computational Results for the Simple Cycle Problem.
Electron. Notes Discret. Math., 2013

Formulating and Solving the Minimum Dominating Cycle Problem.
Electron. Notes Discret. Math., 2013

A Branch-and-price Algorithm for the Multi-Vehicle Covering Tour Problem.
Electron. Notes Discret. Math., 2013

The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method.
Electron. Notes Discret. Math., 2013

The Pickup and Delivery Problem with Cross-Docking.
Comput. Oper. Res., 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
A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking.
Electron. Notes Discret. Math., 2011

Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem.
Electron. Notes Discret. Math., 2011

Heuristic and exact algorithms for a min-max selective vehicle routing problem.
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

A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem.
Electron. Notes Discret. Math., 2010

The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation.
Discret. Appl. Math., 2010

2009
Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized.
Electron. Notes Discret. Math., 2009

The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks.
Electron. Notes Discret. Math., 2009

A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs.
Discret. Appl. Math., 2009

2008
Integer Programming Formulations for the k-Cardinality Tree Problem.
Electron. Notes Discret. Math., 2008

Stronger upper and lower bounds for a hard batching problem to feed assembly lines.
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
Lower and upper bounds for the degree-constrained minimum spanning tree problem.
Networks, 2007

2005
Algorithms for the degree-constrained minimum spanning tree problem.
Electron. Notes Discret. Math., 2005


  Loading...