A constructive proof of Swap Local Search worst-case instances for the Maximum Coverage Problem.
R. B. O. KerkkampKaren AardalPublished in: Oper. Res. Lett. (2016)
Keyphrases
- worst case
- stochastic local search
- search procedures
- memetic algorithm
- lower bound
- initial solution
- random sat instances
- average case
- benchmark instances
- randomly generated
- upper bound
- graph cuts
- tabu search
- combinatorial optimization
- search algorithm
- theorem prover
- propositional satisfiability
- linear logic
- search strategies
- error bounds
- search space
- genetic algorithm
- neural network
- simulated annealing
- optimal solution
- search procedure
- test suite
- greedy algorithm
- linear programming relaxation
- global optimization
- sat instances
- active learning
- systematic search