Search results for "Abilio Lucena"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Sebastián Urrutia, Abilio Lucena	A New Formulation for Spanning Trees.	Electronic Notes in Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena	Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem.	INOC	2011	DBLP DOI BibTeX RDF
1	Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena	The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm.	INOC	2011	DBLP DOI BibTeX RDF
1	Alexandre Salles da Cunha, Laura Bahiense, Abilio Lucena, Cid Carvalho de Souza	A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem.	Electronic Notes in Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Abilio Lucena, Celso C. Ribeiro, Andréa C. Santos	A hybrid heuristic for the diameter constrained minimum spanning tree problem.	J. Global Optimization	2010	DBLP DOI BibTeX RDF
1	Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus, Abilio Lucena	The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation.	Discrete Applied Mathematics	2010	DBLP DOI BibTeX RDF
1	Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende	A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs.	Discrete Applied Mathematics	2009	DBLP DOI BibTeX RDF
1	Victor F. Cavalcante, Cid C. de Souza, Abilio Lucena	A Relax-and-Cut algorithm for the set partitioning problem.	Computers & OR	2008	DBLP DOI BibTeX RDF
1	Isabel Méndez-Díaz, Paula Zabala, Abilio Lucena	A new formulation for the Traveling Deliveryman Problem.	Discrete Applied Mathematics	2008	DBLP DOI BibTeX RDF
1	Alfredo N. Iusem, Abilio Lucena, Nelson Maculan	Preface.	Math. Program.	2008	DBLP DOI BibTeX RDF
1	Alexandre Salles da Cunha, Abilio Lucena	Lower and upper bounds for the degree-constrained minimum spanning tree problem.	Networks	2007	DBLP DOI BibTeX RDF
1	Rafael Andrade, Abilio Lucena, Nelson Maculan	Using Lagrangian dual information to generate degree constrained spanning trees.	Discrete Applied Mathematics	2006	DBLP DOI BibTeX RDF
1	Alexandre Salles da Cunha, Abilio Lucena	Algorithms for the degree-constrained minimum spanning tree problem.	Electronic Notes in Discrete Mathematics	2005	DBLP DOI BibTeX RDF
1	Abilio Lucena	Non Delayed Relax-and-Cut Algorithms.	Annals OR	2005	DBLP DOI BibTeX RDF	relax-and-cut, valid constraints, dual bound strengthening, Lagrangian relaxation
1	Carlos A. J. Martinhon, Abilio Lucena, Nelson Maculan	Stronger K-tree relaxations for the vehicle routing problem.	European Journal of Operational Research	2004	DBLP DOI BibTeX RDF
1	Abilio Lucena, Mauricio G. C. Resende	Strong lower bounds for the prize collecting Steiner problem in graphs.	Discrete Applied Mathematics	2004	DBLP DOI BibTeX RDF
1	Andréa C. dos Santos, Abilio Lucena, Celso C. Ribeiro	Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs.	WEA	2004	DBLP DOI BibTeX RDF
1	Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza	Optimal rectangular partitions.	Networks	2003	DBLP DOI BibTeX RDF
1	Claudio T. Bornstein, Andre Silva Ribeiro, Abilio Lucena	Maximum flow problems under special nonnegative lower bounds on arc flows.	Electronic Notes in Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Abilio Lucena, Mauricio G. C. Resende	Generating lower bounds for the prize collecting Steiner problem in graphs.	Electronic Notes in Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Abilio Lucena, J. E. Beasley	A branch and cut algorithm for the Steiner problem in graphs.	Networks	1998	DBLP DOI BibTeX RDF
1	Nagraj Balakrishnan, Abilio Lucena, Richard T. Wong	Scheduling examinations to reduce second-order conflicts.	Computers & OR	1992	DBLP DOI BibTeX RDF

Publications of "Abilio Lucena" ( http://dblp.L3S.de/Authors/Abilio_Lucena )