Determining r- and (r, s)-robustness of digraphs using mixed integer linear programming.

James Usevitch Dimitra Panagou

Published in: Autom. (2020)

Keyphrases

mixed integer linear programming
branch and bound algorithm
cutting plane
mathematical programming
mixed integer linear program
production planning
lower bound
sufficient conditions
mixed integer
approximate solutions
mixed integer nonlinear programming
optimal solution
directed graph
branch and bound