Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
Year of publication: |
2015
|
---|---|
Authors: | Pereira, Dilson Lucas ; Gendreau, Michel ; Cunha, Alexandre Salles da |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 63.2015, p. 149-160
|
Subject: | Quadratic 0-1 programming | Lagrangian relaxation | Spanning trees | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem |
-
Pereira, Dilson Lucas, (2020)
-
GuimarĂ£es, Dilson Almeida, (2020)
-
An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
Sousa, Ernando Gomes de, (2015)
- More ...
-
Pereira, Dilson Lucas, (2020)
-
Pereira, Dilson Lucas, (2018)
-
GuimarĂ£es, Dilson Almeida, (2020)
- More ...