Exact Algorithms for Treewidth and Minimum Fill-In.
Fedor V. FominDieter KratschIoan TodincaYngve VillangerPublished in: SIAM J. Comput. (2008)
Keyphrases
- exact algorithms
- knapsack problem
- benchmark instances
- approximation algorithms
- exact solution
- benders decomposition
- vehicle routing problem with time windows
- combinatorial optimization problems
- heuristic methods
- combinatorial optimization
- max sat
- upper bound
- nonlinear programming
- computational problems
- combinatorial problems
- search space
- boolean functions
- space complexity
- bounded treewidth
- constraint programming
- genetic algorithm
- optimization problems
- special case
- optimal solution