An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints
Bahadır Pamuk, Temel Öncan, İ. Kuban Altınel
| Year of publication: |
2025
|
|---|---|
| Authors: | Pamuk, Bahadır ; Öncan, Temel ; Altınel, İ. Kuban |
| Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 324.2025, 2 (16.7.), p. 398-413
|
| Subject: | Branch-and-bound | Combinatorial optimization | Conflict constraints | Shortest path problem | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2025.01.044 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10015433055