Abilio Lucena

发表

Maximum flow problems under special nonnegative lower bounds on arc flows

Claudio T. Bornstein, Andre Silva Ribeiro, Abilio Lucena, 2001, Electron. Notes Discret. Math..

A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem

Alexandre Salles da Cunha, Cid C. de Souza, Abilio Lucena, 2010, Electron. Notes Discret. Math..

A branch and cut algorithm for the Steiner problem in graphs

Abilio Lucena, John E. Beasley, 1998, Networks.

Branch and cut algorithms

Abilio Lucena, John E. Beasley, 1996 .

Characterizing acyclic graphs by labeling edges

Abilio Lucena, Sebastián Urrutia, 2014, Discret. Appl. Math..

Mathematical models for optimizing production chain planning in salmon farming

Javier Marenco, Abilio Lucena, Guillermo Durán, 2013, Int. Trans. Oper. Res..

Strong lower bounds for the prize collecting Steiner problem in graphs

Mauricio G. C. Resende, Abilio Lucena, A. Lucena, 2004, Discret. Appl. Math..

Modeling and solving the angular constrained minimum spanning tree problem

Alexandre Salles da Cunha, Abilio Lucena, A. S. Cunha, 2019, Comput. Oper. Res..

Modelling and solving the perfect edge domination problem

Jayme Luiz Szwarcfiter, Min Chih Lin, Abilio Lucena, 2018, Optim. Lett..

A New Formulation and Computational Results for the Simple Cycle Problem

Alexandre Salles da Cunha, Abilio Lucena, Luidi Simonetti, 2013, Electron. Notes Discret. Math..

Scheduling examinations to reduce second-order conflicts

Nagraj Balakrishnan, Abilio Lucena, Richard T. Wong, 1992, Comput. Oper. Res..

Lagrangian heuristics for the Quadratic Knapsack Problem

Abilio Lucena, Luidi Simonetti, Jesus Ossian Cunha, 2016, Comput. Optim. Appl..

Non Delayed Relax-and-Cut Algorithms

Abilio Lucena, 2005, Ann. Oper. Res..

The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method

Alexandre Salles da Cunha, Abilio Lucena, Luidi Simonetti, 2013, Electron. Notes Discret. Math..

The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm

Alexandre Salles da Cunha, Abilio Lucena, Luidi Simonetti, 2011, INOC.

A two commodity flow formulation for the vehicle routing problem

Martin Desrochers, Abilio Lucena, Antoon Kolen, 1988 .

Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem

Alexandre Salles da Cunha, Abilio Lucena, Luidi Simonetti, 2015, Eur. J. Oper. Res..

Lagrangian Relax-and-Cut Algorithms

Abilio Lucena, A. Lucena, 2006, Handbook of Optimization in Telecommunications.

Time-dependent traveling salesman problem-the deliveryman case

Abilio Lucena, A. Lucena, 1990, Networks.

Formulations for the Minimum 2-Connected Dominating Set Problem

Abilio Lucena, Nelson Maculan, Vinicius Leal do Forte, 2013, Electron. Notes Discret. Math..

A New Formulation for Spanning Trees

Abilio Lucena, Sebastián Urrutia, 2011, Electron. Notes Discret. Math..

Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem

Alexandre Salles da Cunha, Abilio Lucena, Luidi Simonetti, 2014, INFORMS J. Comput..

Lower and upper bounds for the degree-constrained minimum spanning tree problem

Alexandre Salles da Cunha, Abilio Lucena, 2007, Networks.

A hybrid heuristic for the diameter constrained minimum spanning tree problem

Celso C. Ribeiro, Abilio Lucena, Andréa C. Santos, 2010, J. Glob. Optim..

A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem

Alexandre Salles da Cunha, Abilio Lucena, Luidi Simonetti, 2016, Electron. Notes Discret. Math..

Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem

Alexandre Salles da Cunha, Abilio Lucena, Luis Henrique Bicalho, 2016, Comput. Optim. Appl..

A Location-Allocation Model for Logistics Integration Centers Subjected to Peer-to-Peer Demands: A Case Study of Soybean Transportation In Brazil

Glaydston Mattos Ribeiro, Abilio Lucena, Vanessa de Almeida Guimarães, 2015 .

Polyhedral results and a Branch-and-cut algorithm for the $$k$$-cardinality tree problem

Alexandre Salles da Cunha, Abilio Lucena, Luidi Simonetti, 2013, Math. Program..

Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs

Celso C. Ribeiro, Abilio Lucena, Andréa C. dos Santos, 2004, WEA.

Algorithms for the degree-constrained minimum spanning tree problem

Alexandre Salles da Cunha, Abilio Lucena, 2005, Electron. Notes Discret. Math..

Formulating and Solving the Minimum Dominating Cycle Problem

Alexandre Salles da Cunha, Abilio Lucena, Luidi Simonetti, 2013, Electron. Notes Discret. Math..

Generating lower bounds for the prize collecting Steiner problem in graphs

Mauricio G. C. Resende, Abilio Lucena, 2001, Electron. Notes Discret. Math..

Erratum to "Characterizing acyclic graphs by labeling edges" [Discrete Appl. Math. 164 (2014) 492-499]

Abilio Lucena, Sebastián Urrutia, 2015, Discret. Appl. Math..

A new formulation for the Traveling Deliveryman Problem

Isabel Méndez-Díaz, Abilio Lucena, Paula Zabala, 2008, Discret. Appl. Math..

The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation

Alexandre Salles da Cunha, Abilio Lucena, Geraldo Robson Mateus, 2010, Discret. Appl. Math..

A Relax-and-Cut algorithm for the set partitioning problem

Cid C. de Souza, Abilio Lucena, Victor F. Cavalcante, 2008, Comput. Oper. Res..

Stronger K-tree relaxations for the vehicle routing problem

Abilio Lucena, Nelson Maculan, Carlos Alberto de Jesus Martinhon, 2004, Eur. J. Oper. Res..

Formulations and exact solution approaches for the degree preserving spanning tree problem

Alexandre Salles da Cunha, Abilio Lucena, Luidi Simonetti, 2015, Networks.

Using Lagrangian dual information to generate degree constrained spanning trees

Abilio Lucena, Nelson Maculan, Rafael Andrade, 2006, Discret. Appl. Math..

The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm

Alexandre Salles da Cunha, Abilio Lucena, Luidi Simonetti, 2016, Electron. Notes Discret. Math..

A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs

Alexandre Salles da Cunha, Mauricio G. C. Resende, Abilio Lucena, 2009, Discret. Appl. Math..

Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem

Alexandre Salles da Cunha, Abilio Lucena, Luidi Simonetti, 2011, INOC.

Reformulations and solution algorithms for the maximum leaf spanning tree problem

Abilio Lucena, Luidi Simonetti, Nelson Maculan, 2010, Comput. Manag. Sci..

Optimal rectangular partitions

Cid C. de Souza, Abilio Lucena, Felipe C. Calheiros, 2003, Networks.

Minimum Concurrency for Assembling Computer Music

Abilio Lucena, Luidi Simonetti, Felipe Maia Galvão França, 2019, INOC.

Optimizing concurrency under Scheduling by Edge Reversal

Abilio Lucena, Luidi Simonetti, Luérbio Faria, 2020, Networks.

Optimizing the petroleum supply chain at petrobras

Abilio Lucena, Luidi Simonetti, Roger Rocha, 2004 .

Lagrangian heuristics for the linear ordering problem

Abilio Lucena, Alexandre Belloni, 2004 .

Lower and upper bounds for the degree-constrained minimum spanning tree problem

Alexandre Salles da Cunha, Abilio Lucena, 2007 .

A Branch and Cut Algorithm for the Steiner Problem in Graphs

Abilio Lucena, John E. Beasley, 1998 .

Lagrangian Based Heuristics for the Linear Ordering Problem

Abilio Lucena, Alexandre Belloni, 2001 .