CP-Lib: Benchmark Instances of the Clique Partitioning Problem.
Michael Malmros SørensenAdam N. LetchfordPublished in: Math. Program. Comput. (2024)
Keyphrases
- benchmark instances
- tabu search
- exact algorithms
- metaheuristic
- memetic algorithm
- vehicle routing problem
- job shop scheduling problem
- traveling salesman problem
- solution quality
- constraint programming
- feasible solution
- set of benchmark instances
- variable neighborhood search
- simulated annealing
- knapsack problem
- test instances
- exact solution
- genetic algorithm
- approximation algorithms
- test problems
- combinatorial optimization
- combinatorial problems
- ant colony optimization
- linear programming
- scheduling problem
- evolutionary computation
- max sat
- evolutionary algorithm
- optimal solution