Polyhedral results and stronger Lagrangean bounds for stable spanning trees.
Phillippe SamerDag HauglandPublished in: Optim. Lett. (2023)
Keyphrases
- spanning tree
- upper bound
- lower bound
- edge disjoint
- minimum spanning tree
- minimum spanning trees
- minimum cost
- upper and lower bounds
- branch and bound
- column generation
- worst case
- lagrangean relaxation
- root node
- lower and upper bounds
- undirected graph
- lipschitz continuity
- vc dimension
- objective function
- optimal solution
- depth first search
- weighted graph
- set covering problem
- linear programming
- optimization problems