.png){kind=icon}
.png){kind=icon}
Return
Addressing capacity uncertainty in resource-constrained assignment problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2004.07.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Resource-constrained assignment problems typically assume capacities are known. We focus on the situation when capacities are uncertain. In addition to the well-known generalized assignment problem (GAP) and the assignment problem with side-constraints (APSC), we discuss two other resource-constrained generalizations of the assignment problem. We identify two alternative approaches to utilize deterministic solution strategies while addressing capacity uncertainty, and illustrate how these approaches can be applied to a specific generalization. We also report the performance of these alternatives on a number of random test problems. (c) 2004 Elsevier Ltd. All rights reserved.
Keywords:
assignment problem
generalized assignment problem
resource constraints
capacity uncertainty
approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available