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 |
-
Ozturk, Onur, (2017)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
Srirangacharyulu, B., (2013)
- More ...
-
Solution methodologies for debris removal in disaster response
Berktaş, Nihal, (2016)
-
Stochastic lot sizing problem with controllable processing times
Koca, Esra, (2015)
-
Compromising system and user interests in shelter location and evacuation planning
Bayram, Vedat, (2015)
- More ...