( en | de | ru )

 

Disambiguation of "Pereira, Dilson Lucas"

Author of the publication

copydeleteadd this publication to your clipboard
Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem.

, , and . Eur. J. Oper. Res., 280 (1): 46-58 (2020)

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.

Dilson Cardoso

Roberto Pereira

Marcos Pereira

Tiago Pereira

Sílvia Pereira

 

Other publications of authors with the same name

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)Exact Solution Algorithms for the Chordless Cycle Problem., , , and . INFORMS J. Comput., 34 (4): 1970-1986 (2022)A 3-Approximation Algorithm for a Particular Case of the Hamiltonian p-Median Problem., and . CoRR, (2022)Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem., and . Networks, 71 (1): 31-50 (2018)Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem., , and . Networks, 65 (4): 367-379 (2015)Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs., , and . Electron. Notes Discret. Math., (2013)Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem., , and . Electron. Notes Discret. Math., (2011)Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem., and . Comput. Oper. Res., (2018)Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem., , and . Eur. J. Oper. Res., 280 (1): 46-58 (2020)Lower bounds and exact algorithms for the quadratic minimum spanning tree problem., , and . Comput. Oper. Res., (2015)