Department of Business Administration2024-11-0920010030-364X10.1287/opre.49.6.913.100232-s2.0-0035521421http://dx.doi.org/10.1287/opre.49.6.913.10023https://hdl.handle.net/20.500.14288/11789In this paper we consider a class of discrete resource-allocation problems with a min-max-sum objective function. We first provide several examples of practical applications of this problem. We then develop a branch-and-bound procedure for solving the general case of this computationally intractable problem. The proposed solution procedure employs a surrogate relaxation technique to obtain lower and upper bounds on the optimal objective function value of the problem. To obtain the multipliers of the surrogate relaxation, two alternative approaches are discussed. We also discuss a simple approximation algorithm with a tight bound. Our computational results support the effectiveness of the branch-and-bound procedure for fairly large-size problems.ManagementOperations researchManagement scienceJournal Article173385900009Q34188