Pamuk, B. Et Al. 2025. An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints. European Journal of Operational Research .

Pamuk, B., ÖNCAN, T., & Altınel, İ. K., (2025). An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints. European Journal of Operational Research .

Pamuk, Bahadır, TEMEL ÖNCAN, And İ. Kuban Altınel. "An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints," European Journal of Operational Research , 2025

Pamuk, Bahadır Et Al. "An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints." European Journal of Operational Research , 2025

Pamuk, B. ÖNCAN, T. And Altınel, İ. K. (2025) . "An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints." European Journal of Operational Research .

@article{article, author={Bahadır Pamuk Et Al. }, title={An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints}, journal={European Journal of Operational Research}, year=2025}