An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints. - Bahadir Pamuk; Temel Öncan; I. Kuban Altinel (Eur. J. Oper. Res., 2025)