( en | de | ru )

 

Disambiguation of "Lucena, Abilio"

Author of the publication

copydeleteadd this publication to your clipboard
A Relax-and-Cut algorithm for the set partitioning problem.

, , and . Comput. Oper. Res., 35 (6): 1963-1981 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Abilio Almeida

Abilio Almeida

Vicente Ferreira Lucena

Josef Lucena-Simon

Daniella Karine Cavalcanti Lucena

 

Other publications of authors with the same name

Lagrangian Relax-and-Cut Algorithms.. Handbook of Optimization in Telecommunications, Springer, (2006)A Relax-and-Cut algorithm for the set partitioning problem., , and . Comput. Oper. Res., 35 (6): 1963-1981 (2008)Modeling and solving the angular constrained minimum spanning tree problem., and . Comput. Oper. Res., (2019)Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem., , and . Comput. Optim. Appl., 63 (3): 755-792 (2016)Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs., , and . WEA, volume 3059 of Lecture Notes in Computer Science, page 458-467. Springer, (2004)The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation., , , and . Discret. Appl. Math., 158 (12): 1305-1314 (2010)A new formulation for the Traveling Deliveryman Problem., , and . Discret. Appl. Math., 156 (17): 3223-3237 (2008)Mixed integer programming and quadratic programming formulations for the interval count problem., , , and . LAGOS, volume 223 of Procedia Computer Science, page 283-291. Elsevier, (2023)Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem., , , and . ISCO, volume 14594 of Lecture Notes in Computer Science, page 30-42. Springer, (2024)Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem., , and . INOC, volume 6701 of Lecture Notes in Computer Science, page 43-50. Springer, (2011)