Search the dblp DataBase

Publications of Author

1. Andréa C. dos Santos, Abilio Lucena, Celso C. Ribeiro
   Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs. [Citation Graph (0, 0)][DBLP]
   WEA, 2004, pp:458-467 [Conf]
   
2. Nagraj Balakrishnan, Abilio Lucena, Richard T. Wong
   Scheduling examinations to reduce second-order conflicts. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 1992, v:19, n:5, pp:353-361 [Journal]
   
3. Rafael Andrade, Abilio Lucena, Nelson Maculan
   Using Lagrangian dual information to generate degree constrained spanning trees. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:5, pp:703-717 [Journal]
   
4. Abilio Lucena, Mauricio G. C. Resende
   Strong lower bounds for the prize collecting Steiner problem in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:277-294 [Journal]
   
5. Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza
   Optimal rectangular partitions. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:41, n:1, pp:51-67 [Journal]
   
6. Abilio Lucena, J. E. Beasley
   A branch and cut algorithm for the Steiner problem in graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 1998, v:31, n:1, pp:39-59 [Journal]
   
7. Carlos Martinhon, Abilio Lucena, Nelson Maculan
   Stronger K. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2004, v:158, n:1, pp:56-71 [Journal]
   
8. 
   A Relax-and-Cut algorithm for the set partitioning problem. [Citation Graph (, )][DBLP]
   
   
9. 
   A new formulation for the Traveling Deliveryman Problem. [Citation Graph (, )][DBLP]
   
   
10. 
    A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. [Citation Graph (, )][DBLP]
    
    
11. 
    The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation. [Citation Graph (, )][DBLP]