Abilio Lucena

According to our database, Abilio Lucena authored at least 49 papers between 1990 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Compact and non-compact formulations for the Dominated Coloring Problem.

Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha

Proceedings of the 11th International Network Optimization Conference, 2024

2023

Extended formulations for perfect domination problems and their algorithmic implications.

Vinicius Leal do Forte, Saïd Hanafi, Abilio Lucena

Eur. J. Oper. Res., October, 2023

Mixed integer programming and quadratic programming formulations for the interval count problem.

Lívia Salgado Medeiros, Fabiano de S. Oliveira, Abilio Lucena, Jayme Luiz Szwarcfiter

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Exact Solution Algorithms for the Chordless Cycle Problem.

Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti

INFORMS J. Comput., 2022

Some New Results on Efficient and Perfect Edge Domination of Graphs.

Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter

CoRR, 2022

2021

Optimizing concurrency under Scheduling by Edge Reversal.

Carlos E. Marciano, Gladstone M. Arantes Jr., Abilio Lucena, Luidi Gelabert Simonetti, Luérbio Faria, Felipe M. G. França

Networks, 2021

2020

Modelling and solving the perfect edge domination problem.

Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter

Optim. Lett., 2020

2019

Modeling and solving the angular constrained minimum spanning tree problem.

Alexandre Salles da Cunha, Abilio Lucena

Comput. Oper. Res., 2019

Minimum Concurrency for Assembling Computer Music.

Carlos E. Marciano, Abilio Lucena, Felipe M. G. França, Luidi Gelabert Simonetti

Proceedings of the 9th International Network Optimization Conference, 2019

2016

The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm.

Abilio Lucena, Luidi Simonetti, Alexandre Salles da Cunha

Electron. Notes Discret. Math., 2016

A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem.

Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena

Electron. Notes Discret. Math., 2016

Lagrangian heuristics for the Quadratic Knapsack Problem.

Jesus Ossian Cunha, Luidi Simonetti, Abilio Lucena

Comput. Optim. Appl., 2016

Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem.

Luis Henrique Bicalho, Alexandre Salles da Cunha, Abilio Lucena

Comput. Optim. Appl., 2016

2015

Formulations and exact solution approaches for the degree preserving spanning tree problem.

Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena, Bernard Gendron

Networks, 2015

Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem.

Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena

Eur. J. Oper. Res., 2015

Erratum to "Characterizing acyclic graphs by labeling edges" [Discrete Appl. Math. 164 (2014) 492-499].

Sebastián Urrutia, Abilio Lucena

Discret. Appl. Math., 2015

2014

Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.

Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti

INFORMS J. Comput., 2014

Characterizing acyclic graphs by labeling edges.

Sebastián Urrutia, Abilio Lucena

Discret. Appl. Math., 2014

2013

Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem.

Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena

Math. Program., 2013

Mathematical models for optimizing production chain planning in salmon farming.

Fernanda Bravo, Guillermo Durán, Abilio Lucena, Javier Marenco, Diego Morán, Andrés Weintraub

Int. Trans. Oper. Res., 2013

A New Formulation and Computational Results for the Simple Cycle Problem.

Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti

Electron. Notes Discret. Math., 2013

Formulating and Solving the Minimum Dominating Cycle Problem.

Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti

Electron. Notes Discret. Math., 2013

The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method.

Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti

Electron. Notes Discret. Math., 2013

Formulations for the Minimum 2-Connected Dominating Set Problem.

Vinicius Leal do Forte, Abilio Lucena, Nelson Maculan

Electron. Notes Discret. Math., 2013

2011

A New Formulation for Spanning Trees.

Sebastián Urrutia, Abilio Lucena

Electron. Notes Discret. Math., 2011

The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm.

Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena

Proceedings of the Network Optimization - 5th International Conference, 2011

Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem.

Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

A hybrid heuristic for the diameter constrained minimum spanning tree problem.

Abilio Lucena, Celso C. Ribeiro, Andréa C. Santos

J. Glob. Optim., 2010

A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem.

Alexandre Salles da Cunha, Laura Bahiense, Abilio Lucena, Cid Carvalho de Souza

Electron. Notes Discret. Math., 2010

The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation.

Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus, Abilio Lucena

Discret. Appl. Math., 2010

Reformulations and solution algorithms for the maximum leaf spanning tree problem.

Abilio Lucena, Nelson Maculan, Luidi Simonetti

Comput. Manag. Sci., 2010

2009

A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs.

Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende

Discret. Appl. Math., 2009

2008

Preface.

Alfredo N. Iusem, Abilio Lucena, Nelson Maculan

Math. Program., 2008

A new formulation for the Traveling Deliveryman Problem.

Isabel Méndez-Díaz, Paula Zabala, Abilio Lucena

Discret. Appl. Math., 2008

A Relax-and-Cut algorithm for the set partitioning problem.

Victor F. Cavalcante, Cid C. de Souza, Abilio Lucena

Comput. Oper. Res., 2008

2007

Lower and upper bounds for the degree-constrained minimum spanning tree problem.

Alexandre Salles da Cunha, Abilio Lucena

Networks, 2007

2006

Using Lagrangian dual information to generate degree constrained spanning trees.

Rafael Andrade, Abilio Lucena, Nelson Maculan

Discret. Appl. Math., 2006

Lagrangian Relax-and-Cut Algorithms.

Abilio Lucena

Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005

Algorithms for the degree-constrained minimum spanning tree problem.

Alexandre Salles da Cunha, Abilio Lucena

Electron. Notes Discret. Math., 2005

Non Delayed Relax-and-Cut Algorithms.

Abilio Lucena

Ann. Oper. Res., 2005

2004

Stronger K-tree relaxations for the vehicle routing problem.

Carlos A. J. Martinhon, Abilio Lucena, Nelson Maculan

Eur. J. Oper. Res., 2004

Strong lower bounds for the prize collecting Steiner problem in graphs.

Abilio Lucena, Mauricio G. C. Resende

Discret. Appl. Math., 2004

Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs.

Andréa C. dos Santos, Abilio Lucena, Celso C. Ribeiro

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003

Optimal rectangular partitions.

Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza

Networks, 2003

2001

Generating lower bounds for the prize collecting Steiner problem in graphs.

Abilio Lucena, Mauricio G. C. Resende

Electron. Notes Discret. Math., 2001

Maximum flow problems under special nonnegative lower bounds on arc flows.

Claudio T. Bornstein, Andre Silva Ribeiro, Abilio Lucena

Electron. Notes Discret. Math., 2001

1998

A branch and cut algorithm for the Steiner problem in graphs.

Abilio Lucena, John E. Beasley

Networks, 1998

1992

Scheduling examinations to reduce second-order conflicts.

Nagraj Balakrishnan, Abilio Lucena, Richard T. Wong

Comput. Oper. Res., 1992

1990

Time-dependent traveling salesman problem-the deliveryman case.

Abilio Lucena

Networks, 1990