Valid Inequality Based Lower Bounds for WCSP.
Mohand Ou Idir KhemmoudjHachemi BennaceurPublished in: CP (2007)
Keyphrases
- lower bound
- branch and bound algorithm
- branch and bound
- max sat
- upper bound
- lower bounding
- np hard
- optimal solution
- objective function
- column generation
- constraint satisfaction problems
- randomly generated problems
- worst case
- upper and lower bounds
- cutting plane
- facet defining
- lower and upper bounds
- lagrangian relaxation
- linear programming
- soft constraints
- linear program
- search algorithm
- linear programming relaxation
- quadratic assignment problem
- genetic algorithm
- optimal cost