A two-level solution approach for solving the generalized minimum spanning tree problem
Petrică C. Pop, Oliviu Matei, Cosmin Sabo, Adrian Petrovan
| Year of publication: |
1 March 2018
|
|---|---|
| Authors: | Pop, Petrică C. ; Matei, Oliviu ; Sabo, Cosmin ; Petrovan, Adrian |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 265.2018, 2 (1.3.), p. 478-487
|
| Subject: | Combinatorial optimization | Generalized minimum spanning tree problem | Genetic algorithms | Decomposition methods | Dynamic programming | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Dynamische Optimierung | Evolutionärer Algorithmus | Evolutionary algorithm | Dekompositionsverfahren | Decomposition method |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2017.08.015 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011811406