Exact solution algorithms for the maximum flow problem with additional conflict constraints
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 |
-
Naderi, Bahman, (2020)
-
Decomposition methods for the parallel machine scheduling problem with setups
Tran, Tony T., (2016)
-
Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
Caselli, Giulia, (2024)
- More ...
-
Assignment problem with conflicts
Öncan, Temel, (2019)
-
Optimal berth allocation and time-invariant quay crane assignment in container terminals
Türkoğulları, Yavuz B., (2014)
-
Türkoğulları, Yavuz B., (2010)
- More ...