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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Elsevier
2019
|
| Subjects: | |
| Online Access: | https://doaj.org/article/05898c0ad5c440f29cd7df04ac0054f2 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|