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 | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory |
-
Pereira, Dilson Lucas, (2020)
-
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
Pereira, Dilson Lucas, (2015)
-
Relations, models and a memetic approach for three degree-dependent spanning tree problems
Cerrone, Carmine, (2014)
- More ...
-
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
Pereira, Dilson Lucas, (2015)
-
Pereira, Dilson Lucas, (2020)
-
Pereira, Dilson Lucas, (2018)
- More ...