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:
(97.83% artigos com DOI)
| Titulo | DOI | Ano |
|---|---|---|
| Extended formulations for perfect domination problems and their algorithmic implications | 10.1016/j.ejor.2023.03.022 | 2023 |
| Mixed integer programming and quadratic programming formulations for the interval count problem | 10.1016/j.procs.2023.08.239 | 2023 |
| Exact Solution Algorithms for the Chordless Cycle Problem | 10.1287/ijoc.2022.1164 | 2022 |
| Optimizing concurrency under Scheduling by Edge Reversal | 10.1002/net.22014 | 2021 |
| Modelling and solving the perfect edge domination problem | 10.1007/s11590-018-1335-x | 2020 |
| Modeling and solving the angular constrained minimum spanning tree problem | 10.1016/j.cor.2019.104775 | 2019 |
| A location-allocation model for Logistics Integration Centers | 10.19272/201706702006 | 2017 |
| Localização-alocação de centros de integração logística submetidos a demandas par-a-par | 10.14295/transportes.v25i1.1027 | 2017 |
| Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem | 10.1007/s10589-015-9788-7 | 2016 |
| Lagrangian heuristics for the Quadratic Knapsack Problem | 10.1007/s10589-015-9763-3 | 2016 |
| The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm | 10.1016/j.endm.2016.03.038 | 2016 |
| A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem | 10.1016/j.endm.2016.03.031 | 2016 |
| Optimality cuts and a Branch-and-cut algorithm for the K − rooted Mini-Max Spanning Forest Problem | 10.1016/j.ejor.2015.05.001 | 2015 |
| Erratum to -Characterizing acyclic graphs by labeling edges- [Discrete Appl. Math. 164 (2014) 492-499] | 10.1016/j.dam.2014.12.018 | 2015 |
| Formulations and exact solution approaches for the degree preserving spanning tree problem | 10.1002/net.21590 | 2015 |
| Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem | 10.1287/ijoc.2013.0589 | 2014 |
| Characterizing acyclic graphs by labeling edges | 10.1016/j.dam.2013.06.019 | 2014 |
| Mathematical models for optimizing production chain planning in salmon farming | 10.1111/itor.12022 | 2013 |
| Formulations for the Minimum 2-Connected Dominating Set Problem | 10.1016/j.endm.2013.05.120 | 2013 |
| Formulating and Solving the Minimum Dominating Cycle Problem | 10.1016/j.endm.2013.05.121 | 2013 |
| The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method | 10.1016/j.endm.2013.05.090 | 2013 |
| A New Formulation and Computational Results for the Simple Cycle Problem | 10.1016/j.endm.2013.10.013 | 2013 |
| Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem | 10.1007/s10107-012-0590-3 | 2013 |
| A New Formulation for Spanning Trees | 10.1016/j.endm.2011.05.034 | 2011 |
| A hybrid heuristic for the diameter constrained minimum spanning tree problem | 10.1007/s10898-009-9430-2 | 2010 |
| The kk-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation | 10.1016/j.dam.2009.01.017 | 2010 |
| Reformulations and solution algorithms for the maximum leaf spanning tree problem | 10.1007/s10287-009-0116-5 | 2010 |
| A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem | 10.1016/j.endm.2010.05.079 | 2010 |
| A relax-and-cut algorithm for the prize-collecting Steiner problem in graphsâ¿¿ | 10.1016/j.dam.2008.02.014 | 2009 |
| A Relax-and-Cut algorithm for the set partitioning problem | 10.1016/j.cor.2006.10.009 | 2008 |
| A new formulation for the Traveling Deliveryman Problem | 10.1016/j.dam.2008.05.009 | 2008 |
| Lower and upper bounds for the degree constrained minimum spanning tree problem | 10.1002/net.20166 | 2007 |
| Using Lagragian Dual Information to Generate Degree Constrained Spanning Trees | 10.1016/j.dam.2005.06.011 | 2006 |
| Non Delayed Relax-and-Cut Algorithms | 10.1007/s10479-005-3977-1 | 2005 |
| Algorithms for the degree-constrained minimum spanning tree problem | 10.1016/j.endm.2005.05.054 | 2005 |
| Stronger k-tree relaxations for the vehicle routing problem | 10.1016/S0377-2217(03)00353-9 | 2004 |
| Strong lower bounds for the prize collecting steiner problem in graphs | 10.1016/S0166-218X(03)00380-9 | 2004 |
| Optimizing the Petroleum Supply Chain at PETROBRAS | 10.1016/S1570-7946(04)80211-6 | 2004 |
| Optimal Rectangular Partitions | 10.1002/net.10058 | 2003 |
| Maximum flow problems under special nonnegative lower bounds on arc flows | 10.1016/S1571-0653(04)00226-4 | 2001 |
| Generating lower bounds for the prize collecting Steiner problem in graphs | 10.1016/S1571-0653(04)00227-6 | 2001 |
| A branch and cut algorithm for the Steiner problem in graphs | 10.1002/(sici)1097-0037(199801)31:1<39::aid-net5>3.0.co;2-l | 1998 |
| Steiner Problem in Graphs: Lagrangean Relaxation and Cutting Planes | 1992 | |
| Scheduling examinations to reduce second-order conflicts | 10.1016/0305-0548(92)90066-E | 1992 |
| Time Dependent Traveling Salesman Problem: The Deliveryman Case | 10.1002/net.3230200605 | 1990 |
| A Comparrisson of Three Correlation techniques for System Identification | 10.1080/00207728308926441 | 1983 |
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 |