The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width.
Meinolf SellmannLuc MercierDaniel H. LeventhalPublished in: CPAIOR (2007)
Keyphrases
- constraint problems
- linear programming
- constraint propagation
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- randomly generated
- linear program
- tree width
- soft constraints
- optimisation problems
- optimal solution
- convex hull
- tree decomposition
- np hard
- arc consistency
- objective function
- interior point methods
- dynamic programming
- primal dual
- quadratic programming
- computational complexity
- semidefinite programming
- bayesian networks
- maximum likelihood
- markov networks
- particle swarm optimization algorithm
- search algorithm
- knapsack problem
- search space
- upper bound
- np complete