Monte carlo tree search on perfect rectangle packing problem instances

Igor Pejic, Daan van den Berg. Monte carlo tree search on perfect rectangle packing problem instances. In Carlos Artemio Coello Coello, editor, GECCO '20: Genetic and Evolutionary Computation Conference, CancĂșn, Mexico, July 8-12, 2020. pages 1697-1703, ACM, 2020. [doi]

@inproceedings{PejicB20,
  title = {Monte carlo tree search on perfect rectangle packing problem instances},
  author = {Igor Pejic and Daan van den Berg},
  year = {2020},
  doi = {10.1145/3377929.3398115},
  url = {https://doi.org/10.1145/3377929.3398115},
  researchr = {https://researchr.org/publication/PejicB20},
  cites = {0},
  citedby = {0},
  pages = {1697-1703},
  booktitle = {GECCO '20: Genetic and Evolutionary Computation Conference, CancĂșn, Mexico, July 8-12, 2020},
  editor = {Carlos Artemio Coello Coello},
  publisher = {ACM},
  isbn = {978-1-4503-7127-8},
}