MRGAP instances

MRGAP (multi-resource generalized assignment problem) instances



NOTE: Types D and E instances should be solved as minimization problems;
      otherwise they are trivial.

These instances are used in:

  M. Yagiura, S. Iwasaki, T. Ibaraki and F. Glover,
  A Very Large-Scale Neighborhood Search Algorithm
  for the Multi-Resource Generalized Assignment Problem,
  Discrete Optimization, 1 (2004) 87-98.

The format is as follows:

number of agents (m), number of jobs (n), number of resources (s)
 for each agent i (i=1,...,m) in turn:
     cost of allocating job j to agent i (j=1,...,n)
 for each agent i (i=1,...,m) in turn:
     for each job j (j=1,...,n) in turn:
         amount of resource k consumed in allocating job j to agent i (k=1,...,s)
 for each agent i (i=1,...,m) in turn:
     amount of resource k available at agent i (k=1,...,s)

Type C instances (tar + gzip)   Type C instances (zip)
Type D instances (tar + gzip)   Type D instances (zip)
Type E instances (tar + gzip)   Type E instances (zip)

Mutsunori YAGIURA (y a g i u r a @ n a g o y a - u . j p)