Ignore:
Timestamp:
Nov 4, 2009 1:19:45 PM (10 years ago)
Author:
forrest
Message:

out probingInfo as not used

File:
1 edited

Legend:

Unmodified
Added
Removed
  • stable/2.3/Cbc/src/CbcNode.cpp

    r1133 r1267  
    25932593  OsiSolverInterface *osiclp = NULL ;
    25942594# endif
    2595   const CglTreeProbingInfo * probingInfo = NULL; //model->probingInfo();
     2595  //const CglTreeProbingInfo * probingInfo = NULL; //model->probingInfo();
    25962596  int saveSearchStrategy2 = model->searchStrategy();
    25972597#define NODE_NEW  2
     
    29122912      sumInfeasibilities_ = 0.0;
    29132913      int bestPriority=COIN_INT_MAX;
     2914#if 0
    29142915      int number01 = 0;
    29152916      const fixEntry * entry = NULL;
     
    29302931        }
    29312932      }
     2933#endif
    29322934      /*
    29332935        Scan for branching objects that indicate infeasibility. Choose candidates
     
    30653067              infeasibility = 0.5-fabs(0.5-part);
    30663068            }
     3069#if 0
    30673070            if (probingInfo) {
    30683071              int iSeq = backward[iColumn];
     
    30763079              }
    30773080            }
     3081#endif
    30783082            if ((numberNodes%PRINT_STUFF)==0&&PRINT_STUFF>0)
    30793083              printf("%d down %d %g up %d %g - infeas %g\n",
     
    31523156      }
    31533157      if (numberUnsatisfied_) {
    3154         if (probingInfo&&false)
    3155           printf("nunsat %d, %d probed, %d other 0-1\n",numberUnsatisfied_,
    3156                 numberUnsatisProbed,numberUnsatisNotProbed);
     3158        //if (probingInfo&&false)
     3159        //printf("nunsat %d, %d probed, %d other 0-1\n",numberUnsatisfied_,
     3160        // numberUnsatisProbed,numberUnsatisNotProbed);
    31573161        // some infeasibilities - go to next steps
    31583162        break;
Note: See TracChangeset for help on using the changeset viewer.