ILOG AMPL 8.000, licensed to "southern methodist-dallas, tx".
AMPL Version 20020516 (OSF1 V4.0)
Executed on Thu Mar  3 05:52:19 2005.

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
g1.txt
n = 10

card(E) = 24


Presolve eliminates 151 constraints.
Adjusted problem:
24 variables, all binary
666 constraints, all linear; 5427 nonzeros
1 linear objective; 24 nonzeros.

ILOG CPLEX 8.000, licensed to "southern methodist-dallas, tx", options: e m b q 
CPLEX 8.0.0: timing=1

Times (seconds):
Input =  0.049776
Solve =  0.076128
Output = 0.00976
CPLEX 8.0.0: optimal integer solution; objective 282
5 MIP simplex iterations
0 branch-and-bound nodes

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
g2.txt
n = 11

card(E) = 28


Presolve eliminates 285 constraints.
Adjusted problem:
28 variables, all binary
1442 constraints, all linear; 12973 nonzeros
1 linear objective; 28 nonzeros.

ILOG CPLEX 8.000, licensed to "southern methodist-dallas, tx", options: e m b q 
CPLEX 8.0.0: timing=1

Times (seconds):
Input =  0.070272
Solve =  0.134688
Output = 0.018544
CPLEX 8.0.0: optimal integer solution; objective 303
7 MIP simplex iterations
0 branch-and-bound nodes

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
g3.txt
n = 12

card(E) = 33


Presolve eliminates 484 constraints.
Adjusted problem:
33 variables, all binary
3178 constraints, all linear; 31553 nonzeros
1 linear objective; 33 nonzeros.

ILOG CPLEX 8.000, licensed to "southern methodist-dallas, tx", options: e m b q 
CPLEX 8.0.0: timing=1

Times (seconds):
Input =  0.119072
Solve =  0.300608
Output = 0.038064
CPLEX 8.0.0: optimal integer solution; objective 155
2 MIP simplex iterations
0 branch-and-bound nodes

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
g4.txt
n = 13

card(E) = 37


Presolve eliminates 1033 constraints.
Adjusted problem:
37 variables, all binary
6481 constraints, all linear; 70962 nonzeros
1 linear objective; 37 nonzeros.

ILOG CPLEX 8.000, licensed to "southern methodist-dallas, tx", options: e m b q 
CPLEX 8.0.0: timing=1

Times (seconds):
Input =  0.232288
Solve =  0.684176
Output = 0.09272
CPLEX 8.0.0: optimal integer solution; objective 230
1 MIP simplex iterations
0 branch-and-bound nodes

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
g5.txt
n = 14

card(E) = 37


Presolve eliminates 2830 constraints.
Adjusted problem:
37 variables, all binary
12296 constraints, all linear; 137955 nonzeros
1 linear objective; 37 nonzeros.

ILOG CPLEX 8.000, licensed to "southern methodist-dallas, tx", options: e m b q 
CPLEX 8.0.0: timing=1

Times (seconds):
Input =  0.418704
Solve =  1.54501
Output = 0.183488
CPLEX 8.0.0: optimal integer solution; objective 292
6 MIP simplex iterations
0 branch-and-bound nodes

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
g6.txt
n = 15

card(E) = 48


Presolve eliminates 2881 constraints.
Adjusted problem:
48 variables, all binary
28620 constraints, all linear; 379967 nonzeros
1 linear objective; 48 nonzeros.

ILOG CPLEX 8.000, licensed to "southern methodist-dallas, tx", options: e m b q 
CPLEX 8.0.0: timing=1

Times (seconds):
Input =  1.1019
Solve =  4.84584
Output = 0.482144
CPLEX 8.0.0: optimal integer solution; objective 228
5 MIP simplex iterations
0 branch-and-bound nodes

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
g7.txt
n = 150

card(E) = 4549

Error executing "solve" command:
error processing set S:
	range too large