A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms.
Joachim KneisDaniel MölleStefan RichterPeter RossmanithPublished in: SIAM J. Discret. Math. (2009)
Keyphrases
- dynamic programming
- exact algorithms
- knapsack problem
- combinatorial optimization problems
- benchmark instances
- bounded treewidth
- exact solution
- upper bound
- approximation algorithms
- vehicle routing problem with time windows
- computational problems
- lower bound
- benders decomposition
- linear programming
- worst case
- combinatorial optimization
- heuristic methods
- high dimensional
- sparse representation
- graph mining
- np hard
- np complete
- combinatorial problems
- evolutionary algorithm
- optimal solution
- objective function