Exact algorithms for weak Roman domination.
Mathieu ChapelleManfred CochefertJean-François CouturierDieter KratschRomain LetourneurMathieu LiedloffAnthony PerezPublished in: Discret. Appl. Math. (2018)
Keyphrases
- exact algorithms
- approximation algorithms
- knapsack problem
- benchmark instances
- vehicle routing problem with time windows
- exact solution
- computational problems
- combinatorial optimization problems
- nonlinear programming
- combinatorial optimization
- heuristic methods
- max sat
- benders decomposition
- machine learning
- combinatorial problems
- constraint satisfaction
- network design problem
- optimal solution
- reinforcement learning