All Stories

  1. We study a single-machine scheduling problem and we solve it with a branch-and-bound algorithm.

    Article • INFORMS Journal on Computing, January 2018, INFORMS

    Giovanni Righini