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 | Theorie | Theory | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Soziales Netzwerk | Social network |
-
Social structure optimization in team formation
Farasat, Alireza, (2016)
-
Ozturk, Onur, (2017)
-
A branch-and-bound algorithm for the concave cost supply problem
Yenipazarli, Arda, (2016)
- More ...
-
Solution methodologies for debris removal in disaster response
Berktaş, Nihal, (2016)
-
Allocation strategies in hub networks
Yaman, Hande, (2011)
-
A multi-stage stochastic programming approach in master production scheduling
Körpeoglu, Ersin, (2011)
- More ...