Can Monte-Carlo Tree Search learn to sacrifice? Nathan CompanezAldeida Aleti OriginalPaper 13 October 2016 Pages: 783 - 813
Minimizing cyclic cutwidth of graphs using a memetic algorithm Pallavi JainKamal SrivastavaGur Saran OriginalPaper 15 October 2016 Pages: 815 - 848
Order acceptance and scheduling with earliness and tardiness penalties Simon TheveninNicolas ZuffereyMarino Widmer OriginalPaper 05 November 2016 Pages: 849 - 890