Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem.
Markus LeitnerPublished in: Comput. Oper. Res. (2016)
Keyphrases
- exact algorithms
- knapsack problem
- approximation algorithms
- exact solution
- benchmark instances
- vehicle routing problem with time windows
- combinatorial problems
- computational problems
- benders decomposition
- heuristic methods
- combinatorial optimization
- max sat
- combinatorial optimization problems
- nonlinear programming
- worst case
- constraint satisfaction