A Branch and Bound Algorithm for Numerical MAX-CSP.
Jean-Marie NormandAlexandre GoldsztejnMarc ChristieFrédéric BenhamouPublished in: CP (2008)
Keyphrases
- branch and bound algorithm
- max csp
- lower bound
- branch and bound
- np hard
- optimal solution
- upper bound
- lower bounding
- precedence constraints
- upper bounding
- combinatorial optimization
- lagrangian relaxation
- arc consistency
- constraint satisfaction
- constraint satisfaction problems
- single machine scheduling problem
- mixed integer linear programming
- randomly generated problems
- finding an optimal solution
- constraint networks
- search space
- np complete
- branch and bound method
- maximum clique
- worst case
- optimisation problems
- variable ordering
- approximation algorithms
- search algorithm