A polyhedral approach to the generalized minimum labeling spanning tree problem
Year of publication: |
2019
|
---|---|
Authors: | Silva, Thiago Gouveia da ; Gueye, Serigne ; Michelon, Philippe ; Ochi, Luiz Satoru ; Cabral, Lucídio dos Anjos F. |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 7.2019, 1, p. 47-77
|
Subject: | Edge-labeled graph | Facets | Polyhedral study | Spanning tree | Graphentheorie | Graph theory | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming |
-
Malekmohammadi, Najmeh, (2018)
-
Sum-of-squares representations for copositive matrices and independent sets in graphs
Vargas, Luis, (2023)
-
A lagrangean heuristic for the degree constrained minimal spanning tree problem
Kawatra, Rakesh, (2010)
- More ...
-
A hybrid metaheuristic for the minimum labeling spanning tree problem
Silva, Thiago Gouveia da, (2019)
-
A parallel hybrid metaheuristic for bicluster editing
Sousa Filho, Gilberto F. de, (2016)
-
Acuna-Agost, Rodrigo, (2011)
- More ...