A Network Flow Algorithm for Solving Generalized Assignment Problem
The generalized assignment problem (GAP) is an open problem in which an integer k is given and one wants to assign k′ agents to kk′≤k jobs such that the sum of the corresponding cost is minimal. Unlike the traditional K-cardinality assignment problem, a job can be assigned to many, but different, ag...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2021-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2021/5803092 |