Task assignment in tree-like hierarchical structures

DOI10.1007/s10878-016-0097-6zbMath1379.90031arXiv1404.0783OpenAlexW1689348504MaRDI QIDQ2410113

Seyedsasan Hashemikhabir, Ismail Hakki Toroslu, Cem Evrendilek

Publication date: 17 October 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.0783

zbMATH Keywords

heuristicsinteger programminglinear programming relaxationNP-hardnesstask assignment

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Group-to-group reviewer assignment problem
• A new polynomial-time algorithm for linear programming
• An efficient approximation for the generalized assignment problem
• A factor 2 approximation algorithm for the generalized Steiner network problem
• A variation of the assignment problem
• On solving a variation of the assignment problem
• Nonlinear assignment problems. Algorithms and applications
• Integer programming models for the multidimensional assignment problem with star costs
• Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms
• A dynamic programming algorithm for tree-like weighted set packing problem
• Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
• Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand
• A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives
• Assignment Problems
• Tight approximation algorithms for maximum general assignment problems
• Reducibility among Combinatorial Problems