A branch-and-bound algorithm for team formation on social networks
Year of publication: |
2021
|
---|---|
Authors: | Berktaş, Nihal ; Yaman, Hande |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 3, p. 1162-1176
|
Subject: | team formation problem | quadratic set covering | branch and bound | reformulation | Arbeitsgruppe | Team | Branch-and-Bound | Branch and Bound | Theorie | Theory | Soziales Netzwerk | Social network | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Branch, bound and remember algorithm for two-sided assembly line balancing problem
Li, Zixiang, (2020)
-
An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines
Hazır, Öncü, (2021)
-
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof, (2022)
- More ...
-
Solution methodologies for debris removal in disaster response
Berktaş, Nihal, (2016)
-
Star p-hub median problem with modular arc capacities
Yaman, Hande, (2008)
-
Çınar, Yüce, (2011)
- More ...