Exact algorithms for delay-bounded steiner arborescences.
Stephan HeldBenjamin RockelPublished in: DAC (2018)
Keyphrases
- exact algorithms
- knapsack problem
- benchmark instances
- exact solution
- approximation algorithms
- computational problems
- combinatorial optimization
- vehicle routing problem with time windows
- combinatorial problems
- max sat
- combinatorial optimization problems
- heuristic methods
- nonlinear programming
- benders decomposition
- optimization problems
- optimal solution
- dynamic programming
- special case
- search algorithm
- information retrieval