Exact Algorithms for Intervalizing Coloured Graphs.
Hans L. BodlaenderJohan M. M. van RooijPublished in: Theory Comput. Syst. (2016)
Keyphrases
- exact algorithms
- knapsack problem
- approximation algorithms
- benchmark instances
- combinatorial optimization
- vehicle routing problem with time windows
- exact solution
- benders decomposition
- combinatorial optimization problems
- heuristic methods
- graph matching
- combinatorial problems
- directed graph
- computational problems
- graph model
- max sat
- traveling salesman problem
- lot sizing
- objective function
- branch and bound
- orders of magnitude
- optimal solution