Alexandre Salles da Cunha

59 papers A 1C 9Journal 49

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