Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
Year of publication: |
2020
|
---|---|
Authors: | GuimarĂ£es, Dilson Almeida ; Cunha, Alexandre Salles da ; Pereira, Dilson Lucas |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 280.2020, 1 (1.1.), p. 46-58
|
Subject: | Combinatorial Optimization | Lagrangian Relaxation | Semi-infinite programming | Semidefinite programming | Spanning Trees | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Branch-and-Bound | Branch and Bound | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem
Chagas, Rosklin Juliano, (2018)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
- More ...
-
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
Pereira, Dilson Lucas, (2015)
-
Pereira, Dilson Lucas, (2018)
-
Exact solution algorithms for the chordless cycle problem
Pereira, Dilson Lucas, (2022)
- More ...