Determining r-Robustness of Arbitrary Digraphs Using Zero-One Linear Integer Programming.
James UsevitchDimitra PanagouPublished in: CoRR (2018)
Keyphrases
- integer programming
- np hard
- constraint programming
- network flow
- production planning
- cutting plane algorithm
- lagrangian relaxation
- cutting plane
- column generation
- linear programming
- set covering problem
- facility location
- transportation problem
- valid inequalities
- integer program
- inference problems
- ai planning
- linear programming relaxation
- equivalence classes
- vehicle routing problem with time windows
- set covering
- quadratic programming