--- Job nw04 Start 10/03/08 03:54:40 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G080908/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- nw04.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/nw04.gdx --- nw04.gms(148) 26 Mb --- Starting execution: elapsed 0:00:00.439 --- nw04.gms(123) 26 Mb --- Generating MIP model m --- nw04.gms(124) 58 Mb --- 37 rows 87,483 columns 724,149 non-zeroes --- 87,482 discrete-columns --- nw04.gms(124) 57 Mb --- Executing SCIP: elapsed 0:00:01.912 SCIP version 1.10.0 [LP solver: Clp 1.8stable] Copyright (c) 2002-2008 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB) Optionfile /home/stefan/work/gams/benchmarks/LINLib.MIP/scip.opt successfully read. Starting MIP solve... presolving: (round 1) 28 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 35 clqs (round 2) 28 del vars, 0 del conss, 0 chg bounds, 28 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 35 clqs (round 3) 28 del vars, 1 del conss, 0 chg bounds, 28 chg sides, 0 chg coeffs, 35 upgd conss, 0 impls, 35 clqs (20.6s) probing: 101/87454 (0.1%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes (20.6s) probing aborted: 100/100 successive totally useless probings presolving (4 rounds): 28 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 28 changed sides, 0 changed coefficients 0 implications, 35 cliques presolved problem has 87454 variables (87454 bin, 0 int, 0 impl, 0 cont) and 35 constraints 35 constraints of type transformed objective value is always integral (scale: 2) Presolving Time: 20.65 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 311 | 209M| 0 | 1.631067e+04 | -- | Inf F 1 | 0 | 370 | 211M| 0 | 1.631067e+04 | 1.751400e+04 | 7.38% 1 | 0 | 392 | 211M| 0 | 1.631133e+04 | 1.751400e+04 | 7.37% 1 | 0 | 403 | 212M| 0 | 1.631167e+04 | 1.751400e+04 | 7.37% 1 | 0 | 420 | 212M| 0 | 1.631183e+04 | 1.751400e+04 | 7.37% 1 | 0 | 437 | 212M| 0 | 1.631238e+04 | 1.751400e+04 | 7.37% 1 | 0 | 467 | 213M| 0 | 1.631304e+04 | 1.751400e+04 | 7.36% 1 | 0 | 482 | 215M| 0 | 1.631345e+04 | 1.751400e+04 | 7.36% 1 | 2 | 482 | 215M| 0 | 1.631345e+04 | 1.751400e+04 | 7.36% (run 1, node 1) restarting after 71234 global fixings of integer variables (restart) converted 12 cuts from the global cut pool into linear constraints presolving: (round 1) 71234 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 0 impls, 46 clqs presolving (2 rounds): 71234 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 0 implications, 46 cliques presolved problem has 16220 variables (16220 bin, 0 int, 0 impl, 0 cont) and 46 constraints 46 constraints of type transformed objective value is always integral (scale: 2) Presolving Time: 22.70 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 755 | 174M| 0 | 1.631345e+04 | 1.751400e+04*| 7.36% 1 | 0 | 767 | 175M| 0 | 1.631357e+04 | 1.751400e+04*| 7.36% 1 | 2 | 767 | 176M| 0 | 1.631357e+04 | 1.751400e+04*| 7.36% (run 2, node 1) restarting after 3462 global fixings of integer variables (restart) converted 2 cuts from the global cut pool into linear constraints presolving: (round 1) 3462 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2 upgd conss, 0 impls, 48 clqs presolving (2 rounds): 3462 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 0 implications, 48 cliques presolved problem has 12758 variables (12758 bin, 0 int, 0 impl, 0 cont) and 48 constraints 48 constraints of type transformed objective value is always integral (scale: 2) Presolving Time: 22.88 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 999 | 173M| 0 | 1.631357e+04 | 1.751400e+04*| 7.36% 1 | 0 | 1025 | 175M| 0 | 1.631380e+04 | 1.751400e+04*| 7.36% 1 | 2 | 1025 | 176M| 0 | 1.631380e+04 | 1.751400e+04*| 7.36% (run 3, node 1) restarting after 6197 global fixings of integer variables (restart) converted 2 cuts from the global cut pool into linear constraints presolving: (round 1) 6197 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2 upgd conss, 0 impls, 50 clqs presolving (2 rounds): 6197 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 0 implications, 50 cliques presolved problem has 6561 variables (6561 bin, 0 int, 0 impl, 0 cont) and 50 constraints 50 constraints of type transformed objective value is always integral (scale: 2) Presolving Time: 23.11 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1290 | 171M| 0 | 1.631380e+04 | 1.751400e+04*| 7.36% 1 | 0 | 1314 | 172M| 0 | 1.631403e+04 | 1.751400e+04*| 7.36% 1 | 2 | 1314 | 172M| 0 | 1.631403e+04 | 1.751400e+04*| 7.36% * 2 | 1 | 1361 | 173M| 1 | 1.633267e+04 | 1.686200e+04 | 3.24% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 66.32 Solving Nodes : 5 (total of 8 nodes in 4 runs) Primal Bound : +1.68620000000000e+04 (8 solutions) Dual Bound : +1.68620000000000e+04 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 66.32 Original Problem : Problem name : gamsmodel Variables : 87482 (87482 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 36 initial, 36 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 6561 (6561 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 50 initial, 50 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 1.82 80893 0 0 0 0 0 0 0 dualfix : 0.04 0 0 0 0 0 0 0 0 boundshift : 0.00 0 0 0 0 0 0 0 0 inttobinary : 0.00 0 0 0 0 0 0 0 0 implics : 0.04 0 0 0 0 0 0 0 0 probing : 18.17 0 0 0 0 0 0 0 0 setppc : 0.52 0 0 0 0 0 0 0 0 linear : 1.54 0 28 0 0 0 1 28 0 root node : - 84905 - - 84905 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 47 0 0 136 0 0 10 setppc : 50 9 269 1 0 0 7796 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 14.73 0.00 0.00 14.73 0.00 setppc : 0.02 0.00 0.02 0.00 0.00 countsols : 0.00 0.00 0.00 0.00 0.00 Propagators : Time Calls Cutoffs DomReds rootredcost : 0.00 1 0 3072 pseudoobj : 0.19 119 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 0 0 0 0.0 0 0.0 - infeasible LP : 0.00 0 0 0 0.0 0 0.0 0 bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0 strong branching : 0.00 0 0 0 0.0 0 0.0 0 pseudo solution : 0.00 0 0 0 0.0 0 0.0 - applied globally : - - - 0 0.0 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 0 - - 0 - (maximal pool size: 6) redcost : 0.15 21 0 82294 0 0 impliedbounds : 0.08 9 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 9 0 0 0 0 strongcg : 0.00 9 0 0 0 0 cmir : 0.42 9 0 0 0 0 flowcover : 5.32 9 0 0 0 0 clique : 11.54 9 0 0 52 0 zerohalf : 0.00 0 0 0 0 0 mcf : 0.00 0 0 0 0 0 Pricers : Time Calls Vars problem variables: 0.00 0 0 Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children relpscost : 14.73 46 0 136 0 0 10 pscost : 0.00 0 0 0 0 0 0 inference : 0.00 0 0 0 0 0 0 mostinf : 0.00 0 0 0 0 0 0 leastinf : 0.00 0 0 0 0 0 0 fullstrong : 0.00 0 0 0 0 0 0 allfullstrong : 0.00 0 0 0 0 0 0 random : 0.00 0 0 0 0 0 0 Primal Heuristics : Time Calls Found LP solutions : 0.00 - 1 pseudo solutions : 0.00 - 0 coefdiving : 0.00 0 0 pscostdiving : 0.00 0 0 oneopt : 0.10 2 0 simplerounding : 0.00 55 0 rounding : 0.36 55 0 shifting : 2.93 13 5 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 feaspump : 0.68 1 1 fracdiving : 0.00 0 0 veclendiving : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 octane : 0.00 0 0 rens : 1.28 1 1 rins : 0.00 0 0 localbranching : 0.00 0 0 mutation : 0.00 0 0 crossover : 0.00 0 0 dins : 0.00 0 0 LP : Time Calls Iterations Iter/call Iter/sec primal LP : 0.15 0 0 0.00 0.00 dual LP : 3.80 58 2240 38.62 589.47 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.59 1 59 59.00 100.00 strong branching : 14.73 253 18911 74.75 1283.84 (at root node) : - 70 5920 84.57 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 4 nodes : 5 nodes (total) : 8 nodes left : 0 max depth : 2 max depth (total): 2 backtracks : 0 (0.0%) delayed cutoffs : 0 repropagations : 1 (0 domain reductions, 0 cutoffs) avg switch length: 2.40 switching time : 0.03 Solution : Solutions found : 8 (2 improvements) Primal Bound : +1.68620000000000e+04 (in run 4, after 2 nodes, 60.66 seconds, depth 1, found by ) Dual Bound : +1.68620000000000e+04 Gap : 0.00 % Root Dual Bound : +1.63140289855072e+04 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- nw04.gms(124) 0 Mb --- Reading solution for model m --- nw04.gms(124) 31 Mb *** Status: Normal completion --- Job nw04.gms Stop 10/03/08 03:55:51 elapsed 0:01:10.770