Towards Stronger Lagrangean Bounds for Stable Spanning Trees.
Phillippe SamerDag HauglandPublished in: INOC (2022)
Keyphrases
- spanning tree
- upper bound
- lower bound
- edge disjoint
- minimum cost
- minimum spanning tree
- minimum spanning trees
- upper and lower bounds
- lower and upper bounds
- np hard
- optimal solution
- depth first search
- worst case
- branch and bound
- error bounds
- weighted graph
- lagrangean relaxation
- minimum total cost
- undirected graph
- branch and bound algorithm
- root node
- column generation
- running times
- set covering problem
- total length
- objective function