Karsu, O.Azizoglu, M.2016-02-082016-02-0820140894-069Xhttp://hdl.handle.net/11693/26404In this study,we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches.EnglishBranch and boundGeneralized assignment problemHeuristicsLinear programming relaxationBranch and bound methodCombinatorial optimizationLinear programmingBi-criteriaComputational resultsGeneralized assignment problemHeuristicsLinear programming relaxationLower and upper boundsMulti-resource generalized assignment problemHeuristic algorithmsArticle10.1002/nav.216071520-6750