Changeset 863 for branches


Ignore:
Timestamp:
Oct 4, 2006 4:10:18 PM (13 years ago)
Author:
forrest
Message:

#define some printf

Location:
branches/devel/Clp/src
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • branches/devel/Clp/src/CbcOrClpParam.cpp

    r861 r863  
    754754    case LOGLEVEL:
    755755      oldValue = model.messageHandler()->logLevel();
    756       model.messageHandler()->setLogLevel(value);
     756      model.messageHandler()->setLogLevel(CoinAbs(value));
    757757      break;
    758758    case SOLVERLOGLEVEL:
     
    16921692  parameters[numberParameters++]=
    16931693    CbcOrClpParam("log!Level","Level of detail in Coin branch and Cut output",
    1694                   -1,63,LOGLEVEL);
     1694                  -63,63,LOGLEVEL);
    16951695  parameters[numberParameters-1].setIntValue(1);
    16961696#endif
     
    18561856     );
    18571857#ifdef COIN_HAS_CBC
     1858  parameters[numberParameters++]=
     1859    CbcOrClpParam("node!Strategy","What strategy to use to select nodes",
     1860                  "fewest",NODESTRATEGY);
     1861  parameters[numberParameters-1].append("depth");
     1862  parameters[numberParameters-1].append("upfewest");
     1863  parameters[numberParameters-1].append("downfewest");
     1864  parameters[numberParameters-1].append("updepth");
     1865  parameters[numberParameters-1].append("downdepth");
     1866  parameters[numberParameters-1].setLonghelp
     1867    (
     1868     "Normally before a solution the code will choose node with fewest infeasibilities. \
     1869You can choose depth as the criterion.  You can also say if up or down branch must \
     1870be done first (the up down choice will carry on after solution)."
     1871     );
    18581872  parameters[numberParameters++]=
    18591873    CbcOrClpParam("numberA!nalyze","Number of analysis iterations",
  • branches/devel/Clp/src/ClpSolve.cpp

    r854 r863  
    11911191          info.setStartingWeight(1.0e3);
    11921192          info.setLightweight(nPasses%10); // special testing
     1193#ifdef COIN_DEVELOP
    11931194          printf("warning - odd lightweight %d\n",nPasses%10);
    11941195          //info.setReduceIterations(6);
     1196#endif
    11951197        }
    11961198      }
     
    14831485      ratio = CoinMax(maxSprintPass/1000,2);
    14841486      maxSprintPass= maxSprintPass %1000;
     1487#ifdef COIN_DEVELOP
    14851488      printf("%d passes wanted with ratio of %d\n",maxSprintPass,ratio);
     1489#endif
    14861490    }
    14871491    // Just take this number of columns in small problem
Note: See TracChangeset for help on using the changeset viewer.