A matheuristic approach for the $b$-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic.
Rafael A. MeloMichell F. QueirozMarcio Costa SantosPublished in: CoRR (2021)
Keyphrases
- mixed integer
- multi start
- integer programming
- metaheuristic
- vehicle routing problem with time windows
- optimal solution
- tabu search
- valid inequalities
- iterated local search
- feasible solution
- np hard
- linear programming
- search space
- cutting plane
- path relinking
- column generation
- production planning
- ant colony optimization
- vehicle routing problem
- search algorithm
- combinatorial optimization
- simulated annealing
- scatter search
- solution space
- optimization problems
- combinatorial optimization problems
- search methods
- global optimization
- stochastic approximation
- combinatorial problems
- genetic algorithm
- objective function
- greedy algorithm
- branch and bound
- particle swarm optimization
- constraint programming
- integer program
- multi objective
- dantzig wolfe decomposition