A Fast Heuristic for Solving the D1EC Coloring Problem.
Fabio CampocciaVincenzo MancusoPublished in: EUC (2010)
Keyphrases
- combinatorial optimization
- finding an optimal solution
- optimal solution
- branch and bound search
- timetabling problem
- dynamic programming algorithms
- search heuristics
- electronic commerce
- packing problem
- sliding tile
- data sets
- obtain the optimal solution
- mip solver
- variable ordering
- lp relaxation
- beam search
- partial solutions
- solution quality
- branch and bound
- metaheuristic
- special case