Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms
Cristina Requejo, Eulália Santos
| Year of publication: |
2020
|
|---|---|
| Authors: | Requejo, Cristina ; Santos, Eulália |
| Published in: |
Operational research : an international journal. - Berlin : Springer, ISSN 1866-1505, ZDB-ID 2425760-6. - Vol. 20.2020, 4, p. 2467-2495
|
| Subject: | Weighted minimum spanning tree | Minimum spanning tree | Lagrangian based algorithms | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
Online Resource
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1007/s12351-018-0426-x [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012306700