 | 2011 |
| 18 |  | 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: 162-169 |
| 17 |  | 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: 412-425 |
| 16 |  | 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: 43-50 |
| 15 |  | 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.
Computer Networks 55(13): 2803-2820 (2011) |
| 14 |  | 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.
Computers & OR 38(7): 1054-1065 (2011) |
| 13 |  | Fernando Afonso Santos,
Geraldo Robson Mateus,
Alexandre Salles da Cunha:
A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking.
Electronic Notes in Discrete Mathematics 37: 249-254 (2011) |
| 12 |  | Dilson Lucas Pereira,
Alexandre Salles da Cunha,
Geraldo Robson Mateus:
Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem.
Electronic Notes in Discrete Mathematics 37: 315-320 (2011) |
| 2010 |
| 11 |  | Frederico Paiva Quintão,
Alexandre Salles da Cunha,
Geraldo Robson Mateus,
Abilio Lucena:
The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation.
Discrete Applied Mathematics 158(12): 1305-1314 (2010) |
| 10 |  | Leonardo Conegundes Martinez,
Alexandre Salles da Cunha:
Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm.
Electronic Notes in Discrete Mathematics 36: 311-318 (2010) |
| 9 |  | 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.
Electronic Notes in Discrete Mathematics 36: 623-630 (2010) |
| 2009 |
| 8 |  | 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.
Discrete Applied Mathematics 157(6): 1198-1217 (2009) |
| 7 |  | 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.
Electronic Notes in Discrete Mathematics 35: 133-138 (2009) |
| 6 |  | Carla Bechelane,
Alexandre Salles da Cunha,
Geraldo Robson Mateus:
The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks.
Electronic Notes in Discrete Mathematics 35: 139-144 (2009) |
| 2008 |
| 5 |  | 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: 239-243 |
| 4 |  | Alexandre Salles da Cunha,
Maurício Cardoso de Souza:
Stronger upper and lower bounds for a hard batching problem to feed assembly lines.
Electronic Notes in Discrete Mathematics 30: 159-164 (2008) |
| 3 |  | Frederico Paiva Quintão,
Alexandre Salles da Cunha,
Geraldo Robson Mateus:
Integer Programming Formulations for the k-Cardinality Tree Problem.
Electronic Notes in Discrete Mathematics 30: 225-230 (2008) |
| 2007 |
| 2 |  | Alexandre Salles da Cunha,
Abilio Lucena:
Lower and upper bounds for the degree-constrained minimum spanning tree problem.
Networks 50(1): 55-66 (2007) |
| 2005 |
| 1 |  | Alexandre Salles da Cunha,
Abilio Lucena:
Algorithms for the degree-constrained minimum spanning tree problem.
Electronic Notes in Discrete Mathematics 19: 403-409 (2005) |