Dados Gerais

Nome:
Abilio Pereira de Lucena Filho
INCTs Associados:
Instituto Nacional de Ciência e Tecnologia em Ciência da Web (Pesquisador associado)
Endereco profissional:
Universidade Federal do Rio de Janeiro
Lab Radioisótopos IBCCF- CCS - UFRJ Ilha do Fundão Rio de Janeiro RJ Brasil

Formação Acadêmica/Titulação

1974-1978
Graduação em Engenharia Eletrica (especialidade Sistemas)
Pontifícia Universidade Católica do Rio de Janeiro
1978-1981
Mestrado em Engenharia Elétrica
Pontifícia Universidade Católica do Rio de Janeiro
1981-1986
Doutorado em Management Science
Imperial Colege Of Science Technology And Medicine
 Voltar ao topo

Publicações

Artigo em Periódico
  • Lucena, Abilio;SALLES DA CUNHA, ALEXANDRE;Simonetti, Luidi . Formulating and Solving the Minimum Dominating Cycle Problem . Electronic Notes in Discrete Mathematics . 2013
  • GENDRON, BERNARD;Lucena, Abilio;SALLES DA CUNHA, ALEXANDRE;Simonetti, Luidi . The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method . Electronic Notes in Discrete Mathematics . 2013
  • DO FORTE, VINICIUS LEAL;Lucena, Abilio;Maculan, Nelson . Formulations for the Minimum 2-Connected Dominating Set Problem . Electronic Notes in Discrete Mathematics . 2013
  • URRUTIA, SEBASTIÁN;LUCENA, ABÍLIO . A New Formulation for Spanning Trees . Electronic Notes in Discrete Mathematics . 2011
  • Maculan, Nelson;Simonetti, Luidi;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Reformulations and solution algorithms for the maximum leaf spanning tree problem . Computational Management Science (Print) . 2010
  • LUCENA FILHO, Abílio Pereira de;SIMONETTI, Luidi Gelabert;MACULAN FILHO, N.;Maculan, N. . REFORMULATIONS AND SOLUTION ALGORITHMS FOR THE MAXIMUM LEAF SPANNING TREE PROBLEM . Computational Management Science (Print) . 2010
  • Quintão, Frederico P.;da Cunha, Alexandre Salles;Mateus, Geraldo R.;Lucena, Abilio . The kk-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation . Discrete Applied Mathematics . 2010
  • RIBEIRO, C. C.;SANTOS, A. C.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A hybrid heuristic for the diameter constrained minimum spanning tree problem . Journal of Global Optimization . 2010
  • SALLES DA CUNHA, ALEXANDRE;BAHIENSE, LAURA;Lucena, Abilio;CARVALHO DE SOUZA, CID . A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem . Electronic Notes in Discrete Mathematics . 2010
  • CUNHA, A. S.;MACULAN, N.;RESENDE, M. G. C.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A relax-and-cut algorithm for the prize-collecting Steiner problem in graphsâ . Discrete Applied Mathematics . 2009
  • CUNHA, A. S.;LUCENA FILHO, Abílio Pereira de;RESENDE, M. G. C.;MACULAN FILHO, N.;Maculan, N. . A Relax-and-Cut Algorithm for the Prize-Collecting Steiner Problem in Graphs . Discrete Applied Mathematics . 2009
  • MENDEZ-DIAZ, I.;ZABALA, P. L.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A new formulation for the Traveling Deliveryman Problem . Discrete Applied Mathematics . 2008
  • CAVALCANTE, V.;SOUZA, C. C.;Abilio Lucena . A Relax-and-Cut algorithm for the set partitioning problem . Computers & Operations Research . 2008
  • CUNHA, A. S.;Abilio Lucena . Lower and upper bounds for the degree constrained minimum spanning tree problem . Networks (New York, N.Y. Print) . 2007
  • ANDRADE, Rafael Castro de;LUCENA FILHO, Abílio Pereira de;MACULAN FILHO, N.;Maculan, N. . Using Lagrangian Dual Information to Generate Degree Constrained Minimum Spanning Trees . Discrete Applied Mathematics . 2006
  • ANDRADE, R.;MACULAN, N.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Using Lagragian Dual Information to Generate Degree Constrained Spanning Trees . Discrete Applied Mathematics . 2006
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Non Delayed Relax-and-Cut Algorithms . Annals of Operation Research . 2005
  • da Cunha, Alexandre Salles;Lucena, Abilio . Algorithms for the degree-constrained minimum spanning tree problem . Electronic Notes in Discrete Mathematics . 2005
  • RESENDE, M. G. C.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Strong lower bounds for the prize collecting steiner problem in graphs . Discrete Applied Mathematics . 2004
  • MARTINHON, C.;MACULAN, N.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Stronger k-tree relaxations for the vehicle routing problem . European Journal of Operational Research . 2004
  • AYRES, M.;ROCHA, R.;SANTIAGO, C.;SIMONETTI, L.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Optimizing the Petroleum Supply Chain at PETROBRAS . Computer-Aided Chemical Engineering . 2004
  • MARTINHON, Carlos Alberto de Jesus;LUCENA FILHO, Abílio Pereira de;MACULAN FILHO, N.;Maculan, N. . Stronger K-tree relaxations for the vehicle routing problem . European Journal of Operational Research . 2004
  • CALHEIROS, F. C.;SOUZA, C. C.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Optimal Rectangular Partitions . Networks (New York, N.Y. Print) . 2003
  • Lucena, Abilio;RESENDE, MAURICIO . Generating lower bounds for the prize collecting Steiner problem in graphs . Electronic Notes in Discrete Mathematics . 2001
  • BORNSTEIN, CLAUDIO;RIBEIRO, ANDRE SILVA;Lucena, Abilio . Maximum flow problems under special nonnegative lower bounds on arc flows . Electronic Notes in Discrete Mathematics . 2001
  • BEASLEY, J. E.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A branch and cut algorithm for the Steiner problem in graphs . Networks (New York Online) . 1998
  • BALAKRISHNAN, N.;WONG, R.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Scheduling examinations to reduce second-order conflicts . Computers & Operations Research . 1992
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Steiner Problem in Graphs: Lagrangean Relaxation and Cutting Planes . Coal Bulletin . 1992
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Time Dependent Traveling Salesman Problem: The Deliveryman Case . Networks (New York, N.Y. Print) . 1990
  • KUBRUSLY, C. S.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A Comparrisson of Three Correlation techniques for System Identification . International Journal of Systems Science . 1983
Artigos em Anais
  • Gendron, B.;LUCENA, A.;CUNHA, A. S.;Simonetti, L. . The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method . LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium - Electronic Notes in Discrete Mathematics . 2013
  • LUCENA, A.;CUNHA, A. S.;Simonetti, L. . A New Formulation and Computational Results for the Simple Cycle Problem . Latin-American Algorithms Graphs and Optimization Symposium (LAGOS) . 2013
  • LUCENA, A.;CUNHA, A. S.;Simonetti, L. . Formulating and Solving the Minimum Dominating Cycle Problem . LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium - Electronic Notes in Discrete Mathematics . 2013
  • SABOIA, C. H. M.;LUCENA, A. . 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 . Power System Computation Conference . 2011
  • CUNHA, A. S.;Simonetti, L.;LUCENA, A. . Formulations and Branch-and-cut algorithm for the K-rooted Mini-Max Spanning Forest Problem . International Network Optimization Conference (INOC) . 2011
  • Simonetti, L.;CUNHA, A. S.;LUCENA, A. . The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-cut algorithm. . International Network Optimization Conference (INOC) . 2011
  • LUCENA, A.;CUNHA, A. S.;Simonetti, L. . A Branch and Cut Algorithm for the Minimum Connected Dominating Set Problem . TRANSLOG - Transportation and Logistics Workshop . 2009
  • MACULAN, N.;SIMONETTI, L.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Reformulations and Solution Algorithms for the Maximum Leaf Spanning Tree Problem . Location and Network Design (LAND) Workshop . 2009
  • LUCENA, A.;CUNHA, A. S.;Simonetti, L. . Exact Solution Algorithms for Maximum Leaf Spanning Tree and Minimum Connected Dominating Set Problems . International Symposium on Mathematical Programming (ISMP) . 2009
  • LUCENA FILHO, Abílio Pereira de;SIMONETTI, Luidi Gelabert;MACULAN FILHO, N.;Maculan, N. . REFORMULATIONS AND SOLUTION ALGORITHMS FOR THE MAX-LEAF SPANNING TREE PROBLEM . VI ALIO/EURO . 2008
  • SIMONETTI, L.;MACULAN, N.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Reformulations and Solution Algorithms for the Max-Leaf Spanning Tree Problem . VI ALIO/EURO Workshop on Applied Combinatorial Optimization . 2008
  • MORAN, D.;DURAN, G.;MARENCO, J.;WEINTRAUB, A.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Planificación de la producción en agua-mar de una empresa salmonera usando programación lineal entera . XIV Ibero-Latin-American Congress on Operations Research . 2008
  • SANTOS, A. C.;RIBEIRO, C. C.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Heuristics for the diameter constrained minimum spannig tree problem . 19th International Symposium on Mathematical Programming . 2006
  • VEIGA, G.;SIMONETTI, L.;MONTEIRO, S.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Short-term production planning in oil refineries: two mixed integer programming models . 19th International Symposium on Mathematical Programming . 2006
  • CUNHA, A. S.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A hybrid Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem . 19th International Symposium on Mathematical Programming . 2006
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . New formulations for the max-leaf spanning tree problem . 19th International Symposium on Mathematical Programming . 2006
  • CAVALCANTE, V. F.;LUCENA, A.;SOUZA, Cid Carvalho de;de Souza, Cid C.;de Souza, C.C.;de Souza, Cid Carvalho;de Souza, Cid;Souza, Cid Carvalho;Carvalho de Souza, Cid;DESOUZA, C;Cid de Souza,;Souza, Cid C. de;Souza, Cid de;Souza, Cid C.;CID DE SOUZA;CID DE SOUZA, NULL;Souza, Cid . A Relax-and-Cut algorithm to the Set Partitioning Problem . Congresso Latino Americano de Investigacion Operativa (CLAIO) . 2006
  • VEIGA, G.;LUCENA, A.;Simonetti, L.;MONTEIRO, S. A. . Short-term production planning in oil refineries: two mixed integer programming models . International Symposium on Mathematical Programming (ISMP) . 2006
  • CUNHA, A. S.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Lower and upper bounds for the degree constrained minimum spanning tree problem . INOC . 2005
  • CALHEIROS, F. C.;SOUZA, C. C.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Optimal Rectangular Partitions . LACGA 2004 . 2004
  • CUNHA, A. S.;MACULAN, N.;RESENDE, M. G. C.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A Relax and Cut algorithm for the prize collecting Steiner problem in graphs . International Symposium on Mathematical Programming . 2003
  • ZABALA, P. L.;MENDEZ, I.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A two-commodity flow approach to the vehicle routing problem . International Symposium on Mathematical Programming . 2003
  • Simonetti, L.;MACULAN, N.;LUCENA, A. . Geração de Colunas para o problema de empocotamento de árvores de Steiner . Simpósio Brasileiro de Pesquisa Operacional (SBPO) . 2003
  • CALHEIROS, F. C.;SOUZA, C. C.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Optimal rectangular partitions . International Symposium on Mathematical Programming . 2003
  • PIMENTEL, A. L. G.;FORMIGA, L.;PONTES, R. C.;MACULAN, N.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . An algorithm for solving large scale set covering problems with applications to the crew pairing problem . CLAIO . 2002
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Relax and Cut algorithms . IV ALIO-EURO Meeting . 2002
  • LUCENA, A.;Bornstein, C.T.;Bornstein, Cláudio T. . Maximum Flow Problems under Special Nonnegative Lower Bounds on Arc Flows . GRACO 2001 . 2001
  • NOGUEIRA, A. B.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Lagrangian based heuristics for the linear ordering problem . 4th Metaheuristics International Conference . 2001
  • BORNSTEIN, C. T.;RIBEIRO, A. S.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Maximizing flow under special non negative lower bounds positive lower bounds on arc flows . Brazilian Symposium on Graphs, Algorithms and Combinatorics . 2001
  • POGGI, M.;RESENDE, M. G. C.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A Lagrangian relaxation for the traveling deliveryman problem . 17th International Symposium on Mathematical Programming . 2000
  • NOGUEIRA, A. B.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A relax and cut algorithm for the traveling salesman problem . 17th International Symposium on Mathematical Programming . 2000
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . The Steiner problem in graphs . ALIO-EURO Conference . 1999
  • RESENDE, M. G. C.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Tight bounds for the prize collecting Steiner problem in graphs . ALIO-EURO Conference . 1999
  • PORTO, O.;PALMEIRA, M. M.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A relax and cut algorithm for the quadratic knapsack problem . ALIO-EURO Conference . 1999
  • MALEBRANCHE, H.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Tighter Eigenvalue based bounds for maximum entropy sampling . 16th International Symposium on Mathematical Programming . 1997
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A network flow based Lagrangean Relaxation Approach to the Quadratic Assignment Problem . Combinatorial Optimisation 96 . 1996
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Steiner Problem in Graphs: Lagrangean Relaxation and Strong Valid Inequalities . 15th International Symposium on Mathematical Programming . 1994
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Steiner problem in graphs: Lagrangean relaxation and cutting planes . NETFLOW 93 . 1993
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Problema de Steiner em Grafos . 5o Congresso da APDIO . 1992
  • BEASLEY, J. E.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A cutting-planes approach to the Steiner problem in graphs . Applied Mathematical Programming and Modelling . 1991
  • BEASLEY, J. E.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A cutting planes approach to the Steiner problem in graphs . ORSA/TIMS Meeting . 1991
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A branch-and-cut algorithm for the Steiner problem in graphs . TIMS XXX - SOBRAPO XXIII Joint International Meeting . 1991
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Tight bounds for the Steiner problem in graphs . 14th International Symposium on Mathematical Programming . 1991
  • BALAKRISHNAN, N.;WONG, R.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Scheduling examinations to reduce second order conflict . ORSA/TIMS Meeting . 1989
  • DESROCHERS, M.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . An optimization algorithm for minimizing the time requires by a service unit to visit customers . EURO IX - TIMS XXVIII Joint International Meeting . 1988
  • CHRISTOFIDES, N.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . An optimization algorithm for the vehicle routing problem based on the elimination of suboptimal routes . EURO IX - TIMS XXVIII Joint International Meeting . 1988
  • FINKE, G.;CHRISTOFIDES, N.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Complementary two-commodity flows . OGOR-SVOR Tatung . 1987
  • DESROCHERS, M.;KOOLEN, A.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . A two-commodity flow approach for the vehicle routing problem . ORSA/TIMS Meeting . 1987
Livros/Edições
  • PONTES, R. C.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Aviação Comercial Controlada por Máquinas Inteligentes . Aviação Comercial Controlada por Máquinas Inteligentes . 2007
Capítulos de Livro
  • SALLES DA CUNHA, ALEXANDRE;Simonetti, Luidi;Lucena, Abilio . Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem . Lecture Notes in Computer Science . 2011
  • LUCENA, A.;MACULAN, N.;A. Salles da Cunha . Relax-and-Cut as a Preprocessor and Warm Starter to Branch-and-Cut, . Progress in Combinatorial Optimization . 2011
  • Simonetti, Luidi;SALLES DA CUNHA, ALEXANDRE;Lucena, Abilio . The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm . Lecture Notes in Computer Science . 2011
  • LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Lagrangian Relax-and-Cut Algorithms . Handbooks on Telecommunications . 2006
  • Santos, Andréa C.;Lucena, Abílio;Ribeiro, Celso C. . Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs . Lecture Notes in Computer Science . 2004
  • NOGUEIRA, A. B.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Lagrangian heuristics for the linear ordering problem . Metaheuristics: computer decision-making . 2004
  • BEASLEY, J. E.;POGGI, M.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . The Vehicle Routing Problem . Handbook of Applied Optimization . 2002
  • BEASLEY, J. E.;LUCENA, A.;Lucena, Abilio;Abilio Lucena;LUCENA, ABÍLIO;Abílio Lucena;Lucena, Abílio . Branch and Cut Algorithms . Advances in Linear and Integer Programming . 1996
Artigos Aceitos
  • URRUTIA, SEBASTIÁN;Lucena, Abilio . Characterizing acyclic graphs by labeling edges . Discrete Applied Mathematics . 2013
  • BRAVO, F.;DURAN, G.;LUCENA, A.;MARENCO, J.;MORAN, D.;WEINTRAUB, A. . Mathematical models for optimizing production chain planning in salmon farming . International Transactions in Operational Research . 2013
  • Simonetti, Luidi;CUNHA, ALEXANDRE SALLES;Lucena, Abilio . Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem . Mathematical Programming . 2012
 Voltar ao topo
Filtrar por tipo:
 Voltar ao topo
 Voltar ao topo