Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Abílio Lucena
Observed names:
A. Lucena,
A. P. LUCENA,
Abilio Lucena,
Lucena, Abilio,
Lucena, Abílio
Institution:
Universidade Federal do Rio de Janeiro
Observed institutions:
Universidade Federal de Minas Gerais,
Conselho Nacional de Desenvolvimento Científico e Tecnológico,
Universidade Federal do Rio de Janeiro,
Universidade Federal Fluminense,
Laboratório Nacional de Computação Científica,
Imperial College London,
UCLouvain
show all 7
ORCID:
0000-0001-6627-7692
Observed ORCID:
0000-0001-6627-7692
OpenAlex ID:
A5013552701
Time‐dependent traveling salesman problem–the deliveryman case
1990
·
Abilio Lucena
·
Networks
·
142
Branch and cut algorithms
1996
·
Abilio Lucena
, John E Beasley
·
Oxford University Press eBooks
·
97
A new formulation for the Traveling Deliveryman Problem
2008
·
Isabel Méndez-Díaz
, Paula Zabala
, et al.
·
Discrete Applied Mathematics
·
91
PDF
Strong lower bounds for the prize collecting Steiner problem in graphs
2003
·
Abilio Lucena
, Mauricio G.C Resende
·
Discrete Applied Mathematics
·
76
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
2014
·
Bernard Gendron
, Abilio Lucena
, et al.
·
INFORMS journal on computing
·
70
Reformulations and solution algorithms for the maximum leaf spanning tree problem
2010
·
Abilio Lucena
, Nelson Maculan
, et al.
·
Computational Management Science
·
51
Non Delayed Relax-and-Cut Algorithms
2005
·
Abilio Lucena
·
Annals of Operations Research
·
51
Scheduling examinations to reduce second-order conflicts
1992
·
Nagraj Balakrishnan
, Abilio Lucena
, et al.
·
Computers & Operations Research
·
51
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
2008
·
Alexandre Salles da Cunha
, Abilio Lucena
, et al.
·
Discrete Applied Mathematics
·
45
Using Lagrangian dual information to generate degree constrained spanning trees
2005
·
Rafael Andrade
, Abilio Lucena
, et al.
·
Discrete Applied Mathematics
·
44
A branch and cut algorithm for the Steiner problem in graphs
1998
·
A. Lucena
, J. E. Beasley
·
Networks
·
44
Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs
2004
·
Andréa C. dos Santos
, Abílio Lucena
, et al.
·
Lecture notes in computer science
·
43
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
2011
·
Luidi Simonetti
, Alexandre Salles da Cunha
, et al.
·
Lecture notes in computer science
·
41
Stronger K-tree relaxations for the vehicle routing problem
2003
·
Carlos Martinhon
, Abilio Lucena
, et al.
·
European Journal of Operational Research
·
35
Lower and upper bounds for the degree‐constrained minimum spanning tree problem
2007
·
Alexandre Salles da Cunha
, Abilio Lucena
·
Networks
·
34
Optimal rectangular partitions
2002
·
Felipe C. Calheiros
, Abilio Lucena
, et al.
·
Networks
·
28
A hybrid heuristic for the diameter constrained minimum spanning tree problem
2009
·
Abilio Lucena
, Celso C. Ribeiro
, et al.
·
Journal of Global Optimization
·
26
Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem
2015
·
Luis Henrique Bicalho
, Alexandre Salles da Cunha
, et al.
·
Computational Optimization and Applications
·
20
The k -Cardinality Tree Problem: Reformulations and Lagrangian Relaxation
2009
·
Frederico P. Quintão
, Alexandre Salles da Cunha
, et al.
·
Discrete Applied Mathematics
·
17
PDF
Lagrangian Heuristics for the Linear Ordering Problem
2003
·
Alexandre Belloni
, Abilio Lucena
·
Applied optimization
·
15
Optimizing the petroleum supply chain at petrobras
2004
·
Mariza Aires
, Abílio Lucena
, et al.
·
Computer-aided chemical engineering/Computer aided chemical engineering
·
14
Mathematical models for optimizing production chain planning in salmon farming
2013
·
Fernanda Bravo
, Guillermo Durán
, et al.
·
International Transactions in Operational Research
·
13
A Relax-and-Cut algorithm for the set partitioning problem
2006
·
Victor F. Cavalcante
, Cid C. de Souza
, et al.
·
Computers & Operations Research
·
12
Formulations for the Minimum 2-Connected Dominating Set Problem
2013
·
Vinicius Leal do Forte
, Abilio Lucena
, et al.
·
Electronic Notes in Discrete Mathematics
·
11
A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem
2010
·
Alexandre Salles da Cunha
, Laura Bahiense
, et al.
·
Electronic Notes in Discrete Mathematics
·
11
Show more works
View as search
Works count:
74
Citation count:
1,193
H-index:
18
I10-index:
28
Year
Topic
Type