A Branch-and-Bound Algorithm for Team Formation on Social Networks

DOI10.1287/IJOC.2020.1000OpenAlexW3112510524MaRDI QIDQ5085484FDOQ5085484

Nihal Berktaş, Hande Yaman

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

zbMATH Keywords

branch-and-boundreformulationteam formation problemquadratic set covering

Mathematics Subject Classification ID

Game theory, economics, finance, and other social and behavioral sciences (91-XX) Operations research, mathematical programming (90-XX)

Cites Work

• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
• A Linearization technique for solving the quadratic set covering problem
• Copositive and semidefinite relaxations of the quadratic assignment problem
• A survey for the quadratic assignment problem
• A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
• PROJECT TEAM SELECTION USING FUZZY OPTIMIZATION APPROACH
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• Solution of large quadratic knapsack problems through aggressive reduction
• L’algebre de Boole et ses applications en recherche operationnelle
• Exact Solution of the Quadratic Knapsack Problem
• Linear programming for the \(0-1\) quadratic knapsack problem
• Team formation based on group technology: a hybrid grouping genetic algorithm approach
• Social structure optimization in team formation
• The multiple team formation problem using sociometry
• Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
• 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
• Team formation: Matching quality supply and quality demand.
• 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization
• On a linearization technique for solving the quadratic set covering problem and variations
• Approximation of the quadratic set covering problem
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
• Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure

Cited In (3)

• A column generation approach for the team formation problem
• The multiple team formation problem using sociometry
• A simple greedy algorithm for the profit-aware social team formation problem

Uses Software

• Knapsack

This page was built for publication: A Branch-and-Bound Algorithm for Team Formation on Social Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085484)