A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing

Rhyd Lewis. A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing. Computers & OR, 36(7):2295-2310, 2009. [doi]

@article{Lewis09-2,
  title = {A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing},
  author = {Rhyd Lewis},
  year = {2009},
  doi = {10.1016/j.cor.2008.09.004},
  url = {http://dx.doi.org/10.1016/j.cor.2008.09.004},
  tags = {case study, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Lewis09-2},
  cites = {0},
  citedby = {0},
  journal = {Computers & OR},
  volume = {36},
  number = {7},
  pages = {2295-2310},
}