Detailed results of the computational experiments of the paper "Combinatorial Auctions: A Survey" (INFORMS J. Computing, (2003) Vol. 15, No 3) by
Sven de Vries and Rakesh Vohra

• result.1a: these are the results solved for Figure 1a. Each line of the file represents the result for one problem. The structure of each line is:
  1 [number of problems in this run] [problem number] [number of items] [number of bids] 0 [runtime in seconds] [value of the optimum] [number of simplex iterations] [number of branch-and-bound nodes] [number of generated clique inequalities] [number of added clique cuts during the optimization]
• result.1b: these are the results solved for Figure 1b. Each line of the file represents the result for one problem. The structure of each line is:
  2 [number of problems in this run] [problem number] [number of items] [number of bids] 0 [runtime in seconds] [value of the optimum] [number of simplex iterations] [number of branch-and-bound nodes] [number of generated clique inequalities] [number of added clique cuts during the optimization]
• result.2a: these are the results solved for Figure 2a. Each line of the file represents the result for one problem. The structure of each line is:
  3 [number of problems in this run] [problem number] [number of items] [number of bids] [size of each bidset] [runtime in seconds] [value of the optimum] [number of simplex iterations] [number of branch-and-bound nodes] [number of generated clique inequalities] [number of added clique cuts during the optimization]
• result.2b: these are the results solved for Figure 2b. Each line of the file represents the result for one problem. The structure of each line is:
  3 [number of problems in this run] [problem number] [number of items] [number of bids] [size of each bidset] [runtime in seconds] [value of the optimum] [number of simplex iterations] [number of branch-and-bound nodes] [number of generated clique inequalities] [number of added clique cuts during the optimization]
• result.3a: these are the results solved for Figure 3a. Each line of the file represents the result for one problem. The structure of each line is:
  4 [number of problems in this run] [problem number] [number of items] [number of bids] [alpha] [runtime in seconds] [value of the optimum] [number of simplex iterations] [number of branch-and-bound nodes] [number of generated clique inequalities] [number of added clique cuts during the optimization]
• result.3b: these are the results solved for Figure 3b. Each line of the file represents the result for one problem. The structure of each line is:
  4 [number of problems in this run] [problem number] [number of items] [number of bids] [alpha] [runtime in seconds] [value of the optimum] [number of simplex iterations] [number of branch-and-bound nodes] [number of generated clique inequalities] [number of added clique cuts during the optimization]
• result.4: these are the results solved for Figure 4. Each line of the file represents the result for one problem. The structure of each line is either:
  3 [number of problems in this run] [problem number] [number of items] [number of bids] [size of each bidset] [runtime in seconds] [value of the optimum] [number of simplex iterations] [number of branch-and-bound nodes] [number of generated clique inequalities] [number of added clique cuts during the optimization]
  or
  5 [number of problems in this run] [problem number] [number of items] [number of bids] [size of each bidset] [runtime in seconds] [value of the optimum] [number of simplex iterations] [number of branch-and-bound nodes] [number of generated clique inequalities] [number of added clique cuts during the optimization]

In case you have any questions or comments about this page (or even better: about its content) please write to Sven de Vries or Rakesh Vohra.