Exact solution algorithms for the maximum flow problem with additional conflict constraints
Zeynep Şuvak, İ. Kuban Altınel, Necati Aras
| Year of publication: |
2020
|
|---|---|
| Authors: | Şuvak, Zeynep ; Altınel, İ. Kuban ; Aras, Necati |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 287.2020, 2 (1.12.), p. 410-437
|
| Subject: | Benders decomposition | branch-and-bound | Combinatorial optimization | Conflict | Maximum flow | Russian doll search | Theorie | Theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Dekompositionsverfahren | Decomposition method | Projektmanagement | Project management | Branch-and-Bound | Branch and Bound | Russland | Russia |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2020.04.001 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012293831