1. Abe, K., Xu, Z., Sato, I., Sugiyama, M.: Solving NP-hard problems on graphs with extended AlphaGo Zero. arXiv:1905.11623 [cs, stat] (2020)
2. Akeba, H., Hifib, M., Mhallah, R.: A beam search algorithm for the circular packing problem. Comput. Oper. Res. 36(5), 1513–1528 (2009)
3. Blum, C., Miralles, C.: On solving the assembly line worker assignment and balancing problem via beam search. Comput. Oper. Res. 38(1), 328–339 (2011)
4. Lecture Notes in Computer Science;C Blum,2007
5. Dai, H., Khalil, E.B., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems, vol. 31, pp. 6348–6358. Curran Associates, Inc. (2017)