A parallel branch-and-bound algorithm with history-based domination. - Taspon Gonggiatgul; Ghassan Shobaki; Pinar Muyan-Özçelik (PPoPP, 2022)

Combining a Parallel Branch-and-Bound Algorithm with a Strong Heuristic to Solve the Sequential Ordering Problem. - Ghassan Shobaki; Taspon Gonggiatgul; Jacob Normington; Pinar Muyan-Özçelik (ICPP Workshops, 2023)

A parallel branch-and-bound algorithm with history-based domination and its application to the sequential ordering problem. - Taspon Gonggiatgul; Ghassan Shobaki; Pinar Muyan-Özçelik (J. Parallel Distributed Comput., 2023)