Polyhedral results and stronger Lagrangean bounds for stable spanning trees.
Phillippe SamerDag HauglandPublished in: CoRR (2022)
Keyphrases
- spanning tree
- upper bound
- lower bound
- edge disjoint
- minimum cost
- minimum spanning tree
- minimum spanning trees
- lipschitz continuity
- upper and lower bounds
- worst case
- branch and bound
- undirected graph
- column generation
- minimum total cost
- lower and upper bounds
- np hard
- optimal solution
- weighted graph
- lagrangean relaxation
- error bounds
- root node
- set valued
- search engine
- line drawings
- feasible solution
- depth first search
- facility location problem
- total length
- convex hull
- special case