[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
R: [Help-glpk] glpk 4.40 benchmarks
From: |
Marco Atzeri |
Subject: |
R: [Help-glpk] glpk 4.40 benchmarks |
Date: |
Thu, 5 Nov 2009 16:45:21 +0000 (GMT) |
--- Mar 3/11/09, Andrew Makhorin ha scritto:
> Below here are glpk 4.40 benchmarks
> for MIPLIB 2.0. All instances
> (except three hard ones) were solved to optimality with the
> hybrid
> pseudocost branching.
>
>
>
> Solver: GLPSOL 4.40 (options used:
> --pcost)
> Computer: Intel Pentium 4, 3.0 GHz
> Platform: Cygwin 1.5.25
> Compiler: GCC 3.4.4 (options used: -O3)
> Test set: MIPLIB 2.0 <http://miplib.zib.de/miplib3/miplib/>
>
> Problem Optimal Solution Cuts Used
> Nodes Iters Time,s Mem,MB
> -------- ---------------- --------- -------- ------ ------
> ------
> air01 +6.796000000e+03
> 3
> 41 < 1 1.2
Hi Andrew,
how you prepared the table ?
I just built the package for cygwin-1.7 with gcc-4.3.4
and I would like to compare the outcome,
but I have no time to manually extract and build the table
The computer is a CORE2Duo, T7250 @ 2GHZ
$ glpsol bell3a.mps
GLPSOL: GLPK LP/MIP Solver 4.40
Parameter(s) specified in the command line:
bell3a.mps
Reading problem data from `bell3a.mps'...
Problem: BELL3A
Objective: OBJ
124 rows, 133 columns, 441 non-zeros
71 integer variables, 39 of which are binary
489 records were read
ipp_basic_tech: 9 row(s) and 0 column(s) removed
ipp_reduce_bnds: 5 pass(es) made, 102 bound(s) reduced
ipp_basic_tech: 11 row(s) and 11 column(s) removed
ipp_reduce_coef: 1 pass(es) made, 0 coefficient(s) reduced
glp_intopt: presolved MIP has 104 rows, 122 columns, 302 non-zeros
glp_intopt: 60 integer columns, 31 of which are binary
Scaling...
A: min|aij| = 8.300e-05 max|aij| = 1.344e+03 ratio = 1.619e+07
GM: min|aij| = 5.095e-01 max|aij| = 1.963e+00 ratio = 3.853e+00
EQ: min|aij| = 2.710e-01 max|aij| = 1.000e+00 ratio = 3.690e+00
2N: min|aij| = 2.500e-01 max|aij| = 1.706e+00 ratio = 6.824e+00
Constructing initial basis...
Size of triangular part = 104
Solving LP relaxation...
0: obj = 7.146700000e+03 infeas = 3.266e+02 (0)
* 56: obj = 1.414685265e+06 infeas = 0.000e+00 (0)
* 82: obj = 8.661717334e+05 infeas = 0.000e+00 (0)
OPTIMAL SOLUTION FOUND
Integer optimization begins...
+ 82: mip = not found yet >= -inf (1; 0)
+ 109: >>>>> 8.784303160e+05 >= 8.733690929e+05 0.6% (27; 0)
+ 21964: mip = 8.784303160e+05 >= 8.768821596e+05 0.2% (2875; 4652)
+ 29741: mip = 8.784303160e+05 >= tree is empty 0.0% (0; 14355)
INTEGER OPTIMAL SOLUTION FOUND
Time used: 7.0 secs
Memory used: 7.1 Mb (7486663 bytes)
Regards
Marco