Formulations and exact algorithms for the minimumspanning tree problemwith conflicting edge pairs
=== This work presents approaches for the exact solution of the minimum spanning tree problem under conflict constraints. Given a graph G(V,E) and a set C E x E of conflicting edge pairs, the problem consists of finding a conflict-free minimum spanning tree, i.e. feasible solutions may include at...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Universidade Federal de Minas Gerais
2014
|
| Online Access: | http://hdl.handle.net/1843/ESBF-9KJQNW |