Persistency of Linear Programming Relaxations for the Stable Set Problem.
Elisabeth Rodríguez-HeckKarl SticklerMatthias WalterStefan WeltgePublished in: IPCO (2020)
Keyphrases
- linear programming relaxation
- knapsack problem
- lower bound
- linear programming
- column generation
- branch and bound
- integer programming
- mixed integer programming
- feasible solution
- upper bounding
- upper bound
- integer program
- cutting plane
- valid inequalities
- worst case
- search algorithm
- optimal solution
- linear program
- mathematical model
- np hard
- genetic algorithm
- neural network