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

DOI10.1287/IJOC.2020.1000MaRDI QIDQ5085484zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Social structure optimization in team formation
• The multiple team formation problem using sociometry
• A set partitioning based goal programming model for the team formation problem
• Research survey on team formation in social networks
• The sociotechnical teams formation problem: a mathematical optimization approach

Cites work

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

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

Describes a project that uses

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)