** COP File Format - Combinatorial Auction Example **
General format: anything outside of parentheses is a comment
[just like this statement].
Stuff in parentheses gives the actual data, and must follow
the following format.
n = number of bids
m = number of goods
n m
(2 3)
N = max vars per constraint, M = max constraints per var.
Here a 0 means that no prior bound on N or M [or both] is specified
These numbers can be used for improved memory allocation but are not required.
N M
(0 0)
A = the negated value of each bid
A
(-3 -1)
bi = the availability of good i
nXsi = the number of non-zero entries for good i
ci = a sparse row represented as a list of pairs (var, coef) where var is a
bid and coef is the amount of good i requested by that bid
b1 nXs1 c1:vars,coefs
(-1 1 (1 1))
b2 nXs2 c2:vars,coefs
(-1 1 (0 1))
b3 nXs3 c3:vars,coefs
(-1 2 (0 1) (1 1))
Note: In our software, it is assumed that all of these numbers are integers.
Optionally, the last entry in parentheses is the optimal value (if known).
This can be used to terminate the run early or for comparison with run
results.
(-3)