Exact algorithms via monotone local search.
Fedor V. FominSerge GaspersDaniel LokshtanovSaket SaurabhPublished in: STOC (2016)
Keyphrases
- exact algorithms
- combinatorial optimization
- knapsack problem
- exact solution
- benchmark instances
- vehicle routing problem with time windows
- combinatorial optimization problems
- approximation algorithms
- optimal solution
- search algorithm
- memetic algorithm
- simulated annealing
- tabu search
- max sat
- computational problems
- combinatorial problems
- heuristic methods
- benders decomposition
- branch and bound
- traveling salesman problem
- nonlinear programming
- search space
- genetic algorithm
- branch and bound algorithm
- job shop scheduling problem
- metaheuristic
- search strategies
- optimization problems
- upper bound
- multi objective
- neural network
- column generation
- lower bound