Determining r- and (r, s)-Robustness of Digraphs Using Mixed Integer Linear Programming.
James UsevitchDimitra PanagouPublished in: CoRR (2019)
Keyphrases
- mixed integer linear programming
- branch and bound algorithm
- cutting plane
- mathematical programming
- mixed integer linear program
- production planning
- mixed integer
- mixed integer nonlinear programming
- branch and bound
- approximate solutions
- optimal solution
- computational complexity
- feature space
- lower bound
- upper bound
- directed graph