Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
Borzou Rostami; Federico Malucelli
| 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 |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011373442