A polyhedral approach to the generalized minimum labeling spanning tree problem
The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple graph G, in which each edge has one label, by using a minimum number of labels. It is an NP-hard problem that was introduced by Chang and Leu (Inf Process L...
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Elsevier
2019
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/05898c0ad5c440f29cd7df04ac0054f2 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|