Publication: A min-max-sum resource allocation problem and its applications
Program
KU-Authors
KU Authors
Co-Authors
Kouvelis, P.
Yu, G.
Publication Date
Language
Type
Embargo Status
Journal Title
Journal ISSN
Volume Title
Alternative Title
Abstract
In 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.
Source
Publisher
Informs
Subject
Management, Operations research, Management science
Citation
Has Part
Source
Operations Research
Book Series Title
Edition
DOI
10.1287/opre.49.6.913.10023