A Branch-and-Bound Algorithm for Team Formation on Social Networks
From MaRDI portal
Publication:5085484
DOI10.1287/ijoc.2020.1000OpenAlexW3112510524MaRDI QIDQ5085484
Publication date: 27 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/77332
Operations research, mathematical programming (90-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)
Related Items
Uses Software
Cites Work
- Social structure optimization in team formation
- The multiple team formation problem using sociometry
- Team formation based on group technology: a hybrid grouping genetic algorithm approach
- Copositive and semidefinite relaxations of the quadratic assignment problem
- A survey for the quadratic assignment problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- On a linearization technique for solving the quadratic set covering problem and variations
- Team formation: Matching quality supply and quality demand.
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- Approximation of the quadratic set covering problem
- Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure
- A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
- Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
- Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives
- PROJECT TEAM SELECTION USING FUZZY OPTIMIZATION APPROACH
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- L’algebre de Boole et ses applications en recherche operationnelle
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- A Linearization technique for solving the quadratic set covering problem
- Exact Solution of the Quadratic Knapsack Problem
- 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
