An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs.
Logan A. SmithDavid T. MildebrathIllya V. HicksPublished in: Networks (2022)
Keyphrases
- integer program
- lower bound
- linear programming relaxation
- column generation
- cutting plane
- branch and bound
- upper bound
- linear program
- branch and bound algorithm
- integer programming
- linear programming
- upper and lower bounds
- objective function
- graph matching
- optimal solution
- directed graph
- weighted graph
- lagrangian relaxation
- valid inequalities
- graph theory
- lower and upper bounds
- undirected graph
- mixed integer
- network flow
- worst case
- np hard
- data structure
- set covering