Preprint
Sep 2026
An Exact Combinatorial Branch-and-Bound Algorithm for the Job Sequencing and Tool Switching Problem
This work proposes an exact algorithm for the SSP, namely the Combinatorial Branch-and-Bound (C-B\&B) algorithm, which combines two distinct branch-and-bound algorithms, each introducing novel features compared with the existing literature.
Alberto Locatelli, Jean-François Côté, Leandro C. Coelho
· 0 citations