1. Can Monte-Carlo Tree Search learn to sacrifice?

   • Nathan Companez
   • Aldeida Aleti

   OriginalPaper 13 October 2016 Pages: 783 - 813

   

2. Minimizing cyclic cutwidth of graphs using a memetic algorithm

   • Pallavi Jain
   • Kamal Srivastava
   • Gur Saran

   OriginalPaper 15 October 2016 Pages: 815 - 848

   

3. Order acceptance and scheduling with earliness and tardiness penalties

   • Simon Thevenin
   • Nicolas Zufferey
   • Marino Widmer

   OriginalPaper 05 November 2016 Pages: 849 - 890