Name
Abstract | ||
|---|---|---|
. In this paper we look at semi-infinite assignment problems. These are situations where a finite set of agents of one type
has to be assigned to an infinite set of agents of another type. This has to be done in such a way that the total profit arising
from these assignments is as large as possible. An infinite programming problem and its dual arise here, which we tackle with
the aid of finite approximations. We prove that there is no duality gap and we show that the core of the corresponding game
is nonempty. Finally, the existence of optimal assignments is discussed. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/s001860200245 | Mathematical Methods of Operations Research |
Keywords | Field | DocType |
balancedness,assignment,balancedness.,cooperative games,infinite programs,assignment problem,profitability | Weapon target assignment problem,Discrete mathematics,Duality gap,Mathematical optimization,Finite set,Semi-infinite,Generalized assignment problem,Infinite set,Mathematics | Journal |
Volume | Issue | ISSN |
57 | 1 | 1432-2994 |
Citations | PageRank | References |
1 | 0.38 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Natividad Llorca | 1 | 55 | 9.41 |
| Stef Tijs | 2 | 546 | 111.01 |
| Judith Timmer | 3 | 101 | 15.67 |