Abilio Lucena

Available identifiers

zbMath Open lucena.abilioMaRDI QIDQ247014

List of research outcomes

Publication	Date of Publication	Type
Optimizing concurrency under Scheduling by Edge Reversal	2023-12-11	Paper
Extended formulations for perfect domination problems and their algorithmic implications	2023-07-11	Paper
Modelling and solving the perfect edge domination problem	2020-04-27	Paper
Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem	2016-10-06	Paper
Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem	2016-04-04	Paper
Lagrangian heuristics for the quadratic knapsack problem	2016-03-07	Paper
Erratum to: ``Characterizing acyclic graphs by labeling edges	2015-04-28	Paper
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem	2015-01-26	Paper
Characterizing acyclic graphs by labeling edges	2014-05-05	Paper
Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem	2014-02-03	Paper
Mathematical models for optimizing production chain planning in salmon farming	2013-11-14	Paper
A New Formulation for Spanning Trees	2013-07-23	Paper
A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem	2012-05-13	Paper
https://portal.mardi4nfdi.de/entity/Q3109938	2012-01-26	Paper
Reformulations and solution algorithms for the maximum leaf spanning tree problem	2010-09-20	Paper
A hybrid heuristic for the diameter constrained minimum spanning tree problem	2010-03-15	Paper
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs	2009-06-23	Paper
A new formulation for the traveling deliveryman problem	2009-03-04	Paper
A relax-and-cut algorithm for the set partitioning problem	2007-11-30	Paper
https://portal.mardi4nfdi.de/entity/Q5294045	2007-07-23	Paper
Lower and upper bounds for the degree-constrained minimum spanning tree problem	2007-07-20	Paper
https://portal.mardi4nfdi.de/entity/Q3439713	2007-05-29	Paper
Using Lagrangian dual information to generate degree constrained spanning trees	2006-04-28	Paper
Non delayed relax-and-cut algorithms	2006-03-07	Paper
Stronger \(K\)-tree relaxations for the vehicle routing problem	2004-08-06	Paper
Strong lower bounds for the prize collecting Steiner problem in graphs	2004-08-06	Paper
Optimal rectangular partitions	2003-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q2741468	2001-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q2741469	2001-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q4355916	2000-04-25	Paper
A branch and cut algorithm for the Steiner problem in graphs	1998-03-05	Paper
Scheduling examinations to reduce second-order conflicts	1993-01-16	Paper
Time‐dependent traveling salesman problem–the deliveryman case	1992-06-25	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Abilio Lucena