Min-degree constrained minimum spanning tree problem with fixed centrals and terminals : complexity, properties and formulations
Fabio C.S. Dias, Manoel Campêlo, Críston Souza, Rafael Andrade
| Year of publication: |
August 2017
|
|---|---|
| Authors: | Dias, Fabio C. S. ; Campêlo, Manoel ; Souza, Críston ; Andrade, Rafael |
| 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. 84.2017, p. 46-61
|
| Subject: | Min-degree constrained minimum spanning tree problem | Integer programming | Lagrangian heuristic | Graphentheorie | Graph theory | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2017.03.001 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011710174