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: Eur. J. Oper. Res. (2021)
Keyphrases
- multi start
- integer programming
- metaheuristic
- vehicle routing problem with time windows
- iterated local search
- tabu search
- path relinking
- search space
- column generation
- np hard
- stochastic approximation
- linear programming
- valid inequalities
- global optimization
- optimization problems
- simulated annealing
- ant colony optimization
- constraint programming
- combinatorial optimization
- scatter search
- greedy algorithm
- optimal solution
- combinatorial optimization problems
- combinatorial problems
- production planning
- lagrangian relaxation
- genetic algorithm
- search algorithm
- particle swarm optimization
- cutting plane
- set partitioning
- dantzig wolfe decomposition
- hill climbing
- search procedure
- solution space
- dynamic programming
- special case
- exact algorithms
- hyper heuristics
- vehicle routing problem
- benchmark problems
- feasible solution
- neural network