Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs.
Hajo BroersmaFedor V. FominPim van 't HofDaniël PaulusmaPublished in: Algorithmica (2013)
Keyphrases
- exact algorithms
- knapsack problem
- approximation algorithms
- vehicle routing problem with time windows
- exact solution
- computational problems
- benchmark instances
- benders decomposition
- heuristic methods
- combinatorial optimization
- max sat
- combinatorial optimization problems
- learning algorithm
- branch and bound
- np hard
- evolutionary algorithm
- search space
- lower bound
- optimal solution
- objective function
- maximum clique
- neural network