Abilio Lucena

According to our database1, Abilio Lucena authored at least 43 papers between 1990 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Modelling and solving the perfect edge domination problem.
Optim. Lett., 2020

2019
Modeling and solving the angular constrained minimum spanning tree problem.
Comput. Oper. Res., 2019

Minimum Concurrency for Assembling Computer Music.
Proceedings of the 9th International Network Optimization Conference, 2019

2016
The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm.
Electron. Notes Discret. Math., 2016

A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem.
Electron. Notes Discret. Math., 2016

Lagrangian heuristics for the Quadratic Knapsack Problem.
Comput. Optim. Appl., 2016

Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem.
Comput. Optim. Appl., 2016

2015
Formulations and exact solution approaches for the degree preserving spanning tree problem.
Networks, 2015

Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem.
Eur. J. Oper. Res., 2015

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

2014
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.
INFORMS J. Comput., 2014

Characterizing acyclic graphs by labeling edges.
Discret. Appl. Math., 2014

2013
Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem.
Math. Program., 2013

Mathematical models for optimizing production chain planning in salmon farming.
Int. Trans. Oper. Res., 2013

A New Formulation and Computational Results for the Simple Cycle Problem.
Electron. Notes Discret. Math., 2013

Formulating and Solving the Minimum Dominating Cycle Problem.
Electron. Notes Discret. Math., 2013

The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method.
Electron. Notes Discret. Math., 2013

Formulations for the Minimum 2-Connected Dominating Set Problem.
Electron. Notes Discret. Math., 2013

2011
A New Formulation for Spanning Trees.
Electron. Notes Discret. Math., 2011

The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm.
Proceedings of the Network Optimization - 5th International Conference, 2011

Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
A hybrid heuristic for the diameter constrained minimum spanning tree problem.
J. Glob. Optim., 2010

A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem.
Electron. Notes Discret. Math., 2010

The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation.
Discret. Appl. Math., 2010

Reformulations and solution algorithms for the maximum leaf spanning tree problem.
Comput. Manag. Sci., 2010

2009
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs.
Discret. Appl. Math., 2009

2008
Preface.
Math. Program., 2008

A new formulation for the Traveling Deliveryman Problem.
Discret. Appl. Math., 2008

A Relax-and-Cut algorithm for the set partitioning problem.
Comput. Oper. Res., 2008

2007
Lower and upper bounds for the degree-constrained minimum spanning tree problem.
Networks, 2007

2006
Using Lagrangian dual information to generate degree constrained spanning trees.
Discret. Appl. Math., 2006

Lagrangian Relax-and-Cut Algorithms.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005
Algorithms for the degree-constrained minimum spanning tree problem.
Electron. Notes Discret. Math., 2005

Non Delayed Relax-and-Cut Algorithms.
Ann. Oper. Res., 2005

2004
Stronger K-tree relaxations for the vehicle routing problem.
Eur. J. Oper. Res., 2004

Strong lower bounds for the prize collecting Steiner problem in graphs.
Discret. Appl. Math., 2004

Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003
Optimal rectangular partitions.
Networks, 2003

2001
Generating lower bounds for the prize collecting Steiner problem in graphs.
Electron. Notes Discret. Math., 2001

Maximum flow problems under special nonnegative lower bounds on arc flows.
Electron. Notes Discret. Math., 2001

1998
A branch and cut algorithm for the Steiner problem in graphs.
Networks, 1998

1992
Scheduling examinations to reduce second-order conflicts.
Comput. Oper. Res., 1992

1990
Time-dependent traveling salesman problem-the deliveryman case.
Networks, 1990


  Loading...