Convex Recoloring Revisited: Complexity and Exact Algorithms.
Iyad A. KanjDieter KratschPublished in: COCOON (2009)
Keyphrases
- exact algorithms
- knapsack problem
- approximation algorithms
- exact solution
- vehicle routing problem with time windows
- worst case
- np hard
- benchmark instances
- benders decomposition
- neural network
- max sat
- combinatorial problems
- combinatorial optimization problems
- cellular automata
- heuristic methods
- convex sets
- computational problems
- scheduling problem
- cost function