Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
Year of publication: |
2014
|
---|---|
Authors: | Rostami, Borzou ; Malucelli, Federico |
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. 64.2015, p. 178-188
|
Subject: | Quadratic minimum spanning tree problem | Lagrangian relaxation | Reformulation-linearization technique | Lower bound | Dual-ascent approach | Reduced costs | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem |
-
Allocating nodes to hubs for minimizing the hubs processing resources : a case study
Balma, Ali, (2019)
-
New genetic algorithm approach for the min-degree constrained minimum spanning tree
Salgueiro, Rui, (2017)
-
GuimarĂ£es, Dilson Almeida, (2020)
- More ...
-
The quadratic shortest path problem : complexity, approximability, and solution methods
Rostami, Borzou, (2018)
-
Lower bounding procedure for the asymmetric quadratic traveling salesman problem
Rostami, Borzou, (2016)
-
Reliable single allocation hub location problem under hub breakdowns
Rostami, Borzou, (2018)
- More ...