Persistency of linear programming relaxations for the stable set problem.
Elisabeth Rodríguez-HeckKarl SticklerMatthias WalterStefan WeltgePublished in: Math. Program. (2022)
Keyphrases
- linear programming relaxation
- knapsack problem
- linear programming
- lower bound
- branch and bound
- column generation
- mixed integer programming
- integer programming
- integer program
- upper bounding
- feasible solution
- valid inequalities
- cutting plane
- upper bound
- greedy algorithm
- branch and bound algorithm
- dynamic programming
- neural network
- np hard
- optimal solution
- genetic algorithm