| 2008 |
|---|
| 15 | EE | Victor F. Cavalcante,
Cid C. de Souza,
Abilio Lucena:
A Relax-and-Cut algorithm for the set partitioning problem.
Computers & OR 35(6): 1963-1981 (2008) |
| 14 | EE | Isabel Méndez-Díaz,
Paula Zabala,
Abilio Lucena:
A new formulation for the Traveling Deliveryman Problem.
Discrete Applied Mathematics 156(17): 3223-3237 (2008) |
| 13 | EE | Alfredo N. Iusem,
Abilio Lucena,
Nelson Maculan:
Preface.
Math. Program. 112(1): 1 (2008) |
| 2007 |
|---|
| 12 | EE | Alexandre Salles da Cunha,
Abilio Lucena:
Lower and upper bounds for the degree-constrained minimum spanning tree problem.
Networks 50(1): 55-66 (2007) |
| 2006 |
|---|
| 11 | EE | Rafael Andrade,
Abilio Lucena,
Nelson Maculan:
Using Lagrangian dual information to generate degree constrained spanning trees.
Discrete Applied Mathematics 154(5): 703-717 (2006) |
| 2005 |
|---|
| 10 | EE | Abilio Lucena:
Non Delayed Relax-and-Cut Algorithms.
Annals OR 140(1): 375-410 (2005) |
| 9 | EE | Alexandre Salles da Cunha,
Abilio Lucena:
Algorithms for the degree-constrained minimum spanning tree problem.
Electronic Notes in Discrete Mathematics 19: 403-409 (2005) |
| 2004 |
|---|
| 8 | EE | Andréa C. dos Santos,
Abilio Lucena,
Celso C. Ribeiro:
Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs.
WEA 2004: 458-467 |
| 7 | EE | Abilio Lucena,
Mauricio G. C. Resende:
Strong lower bounds for the prize collecting Steiner problem in graphs.
Discrete Applied Mathematics 141(1-3): 277-294 (2004) |
| 6 | EE | Carlos A. J. Martinhon,
Abilio Lucena,
Nelson Maculan:
Stronger K-tree relaxations for the vehicle routing problem.
European Journal of Operational Research 158(1): 56-71 (2004) |
| 2003 |
|---|
| 5 | EE | Felipe C. Calheiros,
Abilio Lucena,
Cid C. de Souza:
Optimal rectangular partitions.
Networks 41(1): 51-67 (2003) |
| 2001 |
|---|
| 4 | EE | Claudio T. Bornstein,
Andre Silva Ribeiro,
Abilio Lucena:
Maximum flow problems under special nonnegative lower bounds on arc flows.
Electronic Notes in Discrete Mathematics 7: 66-69 (2001) |
| 3 | EE | Abilio Lucena,
Mauricio G. C. Resende:
Generating lower bounds for the prize collecting Steiner problem in graphs.
Electronic Notes in Discrete Mathematics 7: 70-73 (2001) |
| 1998 |
|---|
| 2 | EE | Abilio Lucena,
J. E. Beasley:
A branch and cut algorithm for the Steiner problem in graphs.
Networks 31(1): 39-59 (1998) |
| 1992 |
|---|
| 1 | EE | Nagraj Balakrishnan,
Abilio Lucena,
Richard T. Wong:
Scheduling examinations to reduce second-order conflicts.
Computers & OR 19(5): 353-361 (1992) |
