An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs.
Logan A. SmithDavid T. MildebrathIllya V. HicksPublished in: CoRR (2020)
Keyphrases
- integer program
- lower bound
- linear programming relaxation
- column generation
- cutting plane
- branch and bound
- upper bound
- integer programming
- linear program
- objective function
- optimal solution
- graph matching
- lower and upper bounds
- branch and bound algorithm
- linear programming
- online algorithms
- set covering
- graph theory
- knapsack problem
- upper and lower bounds
- lagrangian relaxation
- np hard
- lower bounding
- bipartite graph