Abilio Lucena

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 14

Top Topics

Mixed Integer Programming

Hybrid Algorithm

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Comput. Optim. Appl.

Publications

Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha
Compact and non-compact formulations for the Dominated Coloring Problem. INOC (2024)
Dilson Lucas Pereira, Dilson Almeida Guimarães, Alexandre Salles da Cunha, Abilio Lucena
Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem. ISCO (2024)
Lívia Salgado Medeiros, Fabiano Oliveira, Abilio Lucena, Jayme Luiz Szwarcfiter
Mixed integer programming and quadratic programming formulations for the interval count problem. LAGOS (2023)
Vinicius Leal do Forte, Saïd Hanafi, Abilio Lucena
Extended formulations for perfect domination problems and their algorithmic implications. Eur. J. Oper. Res. 310 (2) (2023)
Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
Exact Solution Algorithms for the Chordless Cycle Problem. INFORMS J. Comput. 34 (4) (2022)
Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter
Some New Results on Efficient and Perfect Edge Domination of Graphs. CoRR (2022)
Carlos E. Marciano, Gladstone M. Arantes Jr., Abilio Lucena, Luidi Gelabert Simonetti, Luérbio Faria, Felipe M. G. França
Optimizing concurrency under Scheduling by Edge Reversal. Networks 77 (4) (2021)
Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter
Modelling and solving the perfect edge domination problem. Optim. Lett. 14 (2) (2020)
Alexandre Salles da Cunha, Abilio Lucena
Modeling and solving the angular constrained minimum spanning tree problem. Comput. Oper. Res. 112 (2019)
Carlos E. Marciano, Abilio Lucena, Felipe M. G. França, Luidi Gelabert Simonetti
Minimum Concurrency for Assembling Computer Music. INOC (2019)
Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena
A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 52 (2016)
Abilio Lucena, Luidi Simonetti, Alexandre Salles da Cunha
The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm. Electron. Notes Discret. Math. 52 (2016)
Jesus Ossian Cunha, Luidi Simonetti, Abilio Lucena
Lagrangian heuristics for the Quadratic Knapsack Problem. Comput. Optim. Appl. 63 (1) (2016)
Luis Henrique Bicalho, Alexandre Salles da Cunha, Abilio Lucena
Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem. Comput. Optim. Appl. 63 (3) (2016)
Sebastián Urrutia, Abilio Lucena
Erratum to "Characterizing acyclic graphs by labeling edges" [Discrete Appl. Math. 164 (2014) 492-499]. Discret. Appl. Math. 185 (2015)
Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem. Eur. J. Oper. Res. 246 (2) (2015)
Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena, Bernard Gendron
Formulations and exact solution approaches for the degree preserving spanning tree problem. Networks 65 (4) (2015)
Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. INFORMS J. Comput. 26 (4) (2014)
Sebastián Urrutia, Abilio Lucena
Characterizing acyclic graphs by labeling edges. Discret. Appl. Math. 164 (2014)
Vinicius Leal do Forte, Abilio Lucena, Nelson Maculan
Formulations for the Minimum 2-Connected Dominating Set Problem. Electron. Notes Discret. Math. 41 (2013)
Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
Formulating and Solving the Minimum Dominating Cycle Problem. Electron. Notes Discret. Math. 41 (2013)
Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method. Electron. Notes Discret. Math. 41 (2013)
Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena
Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem. Math. Program. 142 (1-2) (2013)
Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
A New Formulation and Computational Results for the Simple Cycle Problem. Electron. Notes Discret. Math. 44 (2013)
Fernanda Bravo, Guillermo Durán, Abilio Lucena, Javier Marenco, Diego Morán, Andrés Weintraub
Mathematical models for optimizing production chain planning in salmon farming. Int. Trans. Oper. Res. 20 (5) (2013)
Sebastián Urrutia, Abilio Lucena
A New Formulation for Spanning Trees. Electron. Notes Discret. Math. 37 (2011)
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)
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)
Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus, Abilio Lucena
The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation. Discret. Appl. Math. 158 (12) (2010)
Abilio Lucena, Celso C. Ribeiro, Andréa C. Santos
A hybrid heuristic for the diameter constrained minimum spanning tree problem. J. Glob. Optim. 46 (3) (2010)
Abilio Lucena, Nelson Maculan, Luidi Simonetti
Reformulations and solution algorithms for the maximum leaf spanning tree problem. Comput. Manag. Sci. 7 (3) (2010)
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. Electron. Notes Discret. Math. 36 (2010)
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. Discret. Appl. Math. 157 (6) (2009)
Alfredo N. Iusem, Abilio Lucena, Nelson Maculan
Preface. Math. Program. 112 (1) (2008)
Victor F. Cavalcante, Cid C. de Souza, Abilio Lucena
A Relax-and-Cut algorithm for the set partitioning problem. Comput. Oper. Res. 35 (6) (2008)
Isabel Méndez-Díaz, Paula Zabala, Abilio Lucena
A new formulation for the Traveling Deliveryman Problem. Discret. Appl. Math. 156 (17) (2008)
Alexandre Salles da Cunha, Abilio Lucena
Lower and upper bounds for the degree-constrained minimum spanning tree problem. Networks 50 (1) (2007)
Rafael Andrade, Abilio Lucena, Nelson Maculan
Using Lagrangian dual information to generate degree constrained spanning trees. Discret. Appl. Math. 154 (5) (2006)
Abilio Lucena
Non Delayed Relax-and-Cut Algorithms. Ann. Oper. Res. 140 (1) (2005)
Alexandre Salles da Cunha, Abilio Lucena
Algorithms for the degree-constrained minimum spanning tree problem. Electron. Notes Discret. Math. 19 (2005)
Carlos A. J. Martinhon, Abilio Lucena, Nelson Maculan
Stronger K-tree relaxations for the vehicle routing problem. Eur. J. Oper. Res. 158 (1) (2004)
Andréa C. dos Santos, Abilio Lucena, Celso C. Ribeiro
Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs. WEA (2004)
Abilio Lucena, Mauricio G. C. Resende
Strong lower bounds for the prize collecting Steiner problem in graphs. Discret. Appl. Math. 141 (1-3) (2004)
Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza
Optimal rectangular partitions. Networks 41 (1) (2003)
Abilio Lucena, Mauricio G. C. Resende
Generating lower bounds for the prize collecting Steiner problem in graphs. Electron. Notes Discret. Math. 7 (2001)
Claudio T. Bornstein, Andre Silva Ribeiro, Abilio Lucena
Maximum flow problems under special nonnegative lower bounds on arc flows. Electron. Notes Discret. Math. 7 (2001)
Abilio Lucena, John E. Beasley
A branch and cut algorithm for the Steiner problem in graphs. Networks 31 (1) (1998)
Nagraj Balakrishnan, Abilio Lucena, Richard T. Wong
Scheduling examinations to reduce second-order conflicts. Comput. Oper. Res. 19 (5) (1992)
Abilio Lucena
Time-dependent traveling salesman problem-the deliveryman case. Networks 20 (6) (1990)