On the Enumeration of Non-dominated Spanning Trees with Imprecise Weights.
Tom DavotSébastien DesterckeDavid SavoureyPublished in: ECSQARU (2023)
Keyphrases
- spanning tree
- edge weights
- edge disjoint
- minimum cost
- minimum spanning tree
- minimum spanning trees
- linear combination
- weighted sum
- root node
- undirected graph
- objective function
- uncertain information
- relative importance
- search space
- optimal solution
- partial information
- search algorithm
- approximation algorithms
- particle swarm optimization
- dynamic programming