A branch and bound algorithm for numerical Max-CSP.
Jean-Marie NormandAlexandre GoldsztejnMarc ChristieFrédéric BenhamouPublished in: Constraints An Int. J. (2010)
Keyphrases
- branch and bound algorithm
- max csp
- lower bound
- branch and bound
- np hard
- lower bounding
- upper bound
- precedence constraints
- randomly generated problems
- optimal solution
- arc consistency
- upper bounding
- combinatorial optimization
- variable ordering
- lagrangian relaxation
- single machine scheduling problem
- constraint satisfaction
- max sat
- branch and bound method
- mixed integer linear programming
- constraint networks
- finding an optimal solution
- optimisation problems
- constraint satisfaction problems
- search space
- search algorithm
- soft constraints
- qualitative and quantitative
- genetic programming
- special case