Fast exact algorithms for some connectivity problems parametrized by clique-width.
Benjamin BergougnouxMamadou Moustapha KantéPublished in: CoRR (2017)
Keyphrases
- exact algorithms
- computational problems
- exact solution
- knapsack problem
- vehicle routing problem with time windows
- heuristic methods
- optimization problems
- benders decomposition
- combinatorial problems
- combinatorial optimization problems
- combinatorial optimization
- benchmark problems
- search methods
- constraint programming
- benchmark instances
- decision problems
- linear program
- neural network