Abilio Lucena - RankMe

54 papers C 6Journal 46Unranked 1

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