Abilio Pereira de Lucena Filho
Instituição:
Universidade Federal do Rio de Janeiro
Centro:
Centro de Tecnologia
Unidade:
Coordenação dos Programas de Pós-Graduação de Engenharia
Departamento:
Programa de Engenharia de Sistemas/COPPE
Formação:
-
Université Catholique de Louvain
| Pós-Doutorado | 1987 - 1988
-
Erasmus Universiteit Rotterdam
| Pós-Doutorado | 1986 - 1987
-
Imperial Colege Of Science Technology And Medicine
Management Science | Doutorado | 1981 - 1986
-
Pontifícia Universidade Católica do Rio de Janeiro
Engenharia Elétrica | Mestrado | 1978 - 1981
-
Pontifícia Universidade Católica do Rio de Janeiro
Engenharia Eletrica (especialidade Sistemas) | Graduação | 1974 - 1978
Laboratórios:
Nenhum laboratório cadastrado
Nuvens de Palavras:
Artigos:
Nenhum artigo cadastrado
Eventos:
(2.22% eventos com DOI)
| Titulo | DOI | Ano |
|---|---|---|
| Minimum Concurrency for Assembling Computer Music | 10.5441/002/inoc.2019.16 | 2019 |
| An Exact Algorithm for the Perfect Edge Domination Problem | 2018 | |
| Analytical Models to Estimate Connectivity and Value in the International Trade of Supplies | 2017 | |
| An Exact Algorithm for the Perfect Edge Domination Problem | 2017 | |
| A column generation approach for solving very large scale instances of the Brazilian long term power expansion planning model A column generation approach for solving very large scale instances of the Brazilian long term power expansion planning model | 2011 | |
| Reformulations and Solution Algorithms for the Maximum Leaf Spanning Tree Problem | 2009 | |
| Reformulations and Solution Algorithms for the Max-Leaf Spanning Tree Problem | 2008 | |
| Planificación de la producción en agua-mar de una empresa salmonera usando programación lineal entera | 2008 | |
| New formulations for the max-leaf spanning tree problem | 2006 | |
| A hybrid Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem | 2006 | |
| Heuristics for the diameter constrained minimum spannig tree problem | 2006 | |
| Short-term production planning in oil refineries: two mixed integer programming models | 2006 | |
| Lower and upper bounds for the degree constrained minimum spanning tree problem | 2005 | |
| Optimal Rectangular Partitions | 2004 | |
| A two-commodity flow approach to the vehicle routing problem | 2003 | |
| A Relax and Cut algorithm for the prize collecting Steiner problem in graphs | 2003 | |
| Optimal rectangular partitions | 2003 | |
| An algorithm for solving large scale set covering problems with applications to the crew pairing problem | 2002 | |
| Relax and Cut algorithms | 2002 | |
| Lagrangian based heuristics for the linear ordering problem | 2001 | |
| Maximizing flow under special non negative lower bounds positive lower bounds on arc flows | 2001 | |
| A relax and cut algorithm for the quadratic knapsack problem | 2000 | |
| Tight bounds for the prize collecting Steiner problem in graphs | 2000 | |
| A relax and cut algorithm for the quadratic knapsack problem | 2000 | |
| A Lagrangian relaxation for the traveling deliveryman problem | 2000 | |
| A relax and cut algorithm for the traveling salesman problem | 2000 | |
| Tight bounds for the prize collecting Steiner problem in graphs | 2000 | |
| A relax and cut algorithm for the quadratic knapsack problem | 1999 | |
| Tight bounds for the prize collecting Steiner problem in graphs | 1999 | |
| The Steiner problem in graphs | 1999 | |
| Tighter Eigenvalue based bounds for maximum entropy sampling | 1997 | |
| A network flow based Lagrangean Relaxation Approach to the Quadratic Assignment Problem | 1996 | |
| Steiner Problem in Graphs: Lagrangean Relaxation and Strong Valid Inequalities | 1994 | |
| Steiner problem in graphs: Lagrangean relaxation and cutting planes | 1993 | |
| Problema de Steiner em Grafos | 1992 | |
| Tight bounds for the Steiner problem in graphs | 1992 | |
| A cutting-planes approach to the Steiner problem in graphs | 1991 | |
| A cutting planes approach to the Steiner problem in graphs | 1991 | |
| A branch-and-cut algorithm for the Steiner problem in graphs | 1991 | |
| Tight bounds for the Steiner problem in graphs | 1991 | |
| Scheduling examinations to reduce second order conflict | 1989 | |
| An optimization algorithm for the vehicle routing problem based on the elimination of suboptimal routes | 1988 | |
| An optimization algorithm for minimizing the time requires by a service unit to visit customers | 1988 | |
| Complementary two-commodity flows | 1987 | |
| A two-commodity flow approach for the vehicle routing problem | 1987 |