A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing.
Rhyd LewisPublished in: Comput. Oper. Res. (2009)
Keyphrases
- bin packing
- graph colouring
- hill climbing
- general purpose
- cost function
- objective function
- tabu search
- search methods
- direct search
- search space
- optimization problems
- neural network
- search procedure
- simulated annealing
- steepest ascent
- combinatorial optimization
- search strategy
- search tree
- combinatorial problems
- round robin
- nearest neighbor
- dynamic programming