Lucena Abilio

Abilio Lucena

Information about the author Abilio Lucena will soon be added to the site.
Found 5 papers in total
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
2015
Let G = ( V, E ) be an undirected graph with costs associated with its edges and K...
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Reformulations and solution algorithms for the maximum leaf spanning tree problem
2010
Given a graph G = ( V , E ), the maximum leaf spanning tree problem (MLSTP) is to find...
A hybrid heuristic for the diameter constrained minimum spanning tree problem
A hybrid heuristic for the diameter constrained minimum spanning tree problem
2010
We propose a hybrid GRASP and Iterated Local Search (ILS) based heuristic for the...
Non delayed relax-and-cut algorithms
Non delayed relax-and-cut algorithms
2005
Attempts to allow exponentially many inequalities to be candidates to Lagrangian...
Stronger K-tree relaxations for the vehicle routing problem
Stronger K-tree relaxations for the vehicle routing problem
2004
A Lagrangian based exact solution algorithm for the vehicle routing problem (VRP),...
Papers per page: