Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem.
Alexander EngauMiguel F. AnjosImmanuel M. BomzePublished in: Math. Methods Oper. Res. (2013)
Keyphrases
- interior point methods
- interior point
- linear programming
- linear programming problems
- semidefinite
- quadratic programming
- primal dual
- solving problems
- semidefinite programming
- convex optimization
- linear program
- simplex method
- lp relaxation
- computationally intensive
- integer programming
- lower bound
- integer program
- optimal solution
- convex relaxation
- column generation
- feasible solution
- combinatorial optimization
- np hard
- objective function
- nonnegative matrix factorization
- matrix factorization
- linear programming relaxation
- extreme points