Combinatorial Optimization on Graphs of Bounded Treewidth.
Hans L. BodlaenderArie M. C. A. KosterPublished in: Comput. J. (2008)
Keyphrases
- combinatorial optimization
- bounded treewidth
- np complete
- combinatorial optimization problems
- decision problems
- metaheuristic
- conjunctive queries
- traveling salesman problem
- simulated annealing
- highly parallelizable
- boolean functions
- branch and bound algorithm
- optimization problems
- relational learning
- graph theory
- combinatorial problems
- exact algorithms
- query answering
- information retrieval
- databases
- neural network
- graph theoretic
- genetic algorithm
- optimal solution
- computational complexity
- multi objective
- integrity constraints