Ignore:
Timestamp:
Dec 4, 2009 5:15:40 PM (10 years ago)
Author:
bjarni
Message:

Added Lou's annotations to Cbc_ampl.cpp, CbcSolver?.cpp, CbcSolver?.hpp, CbcStrategy?.cpp, CbcTreeLocal?.cpp, ClpAmplStuff?.cpp, CoinSolve?.cpp, and unitTestClp.cpp

File:
1 edited

Legend:

Unmodified
Added
Removed
  • branches/sandbox/Cbc/src/CbcTreeLocal.cpp

    r1286 r1361  
    747747            int iColumn = integerVariable[i];
    748748            double value = floor(solution[iColumn] + 0.5);
     749            /*
     750              typeCuts_ == 0 restricts to binary, 1 allows general integer. But we're
     751              still restricted to being up against a bound. Consider: the notion is that
     752              the cut restricts us to a k-neighbourhood. For binary variables, this
     753              amounts to k variables which change value. For general integer, we could
     754              end up with a single variable sucking up all of k (hence mu --- the
     755              variable must swing to its other bound to look like a movement of 1).  For
     756              variables in the middle of a range, we're talking about fabs(sol<j> - x<j>).
     757            */
    749758            if (!typeCuts_ && originalUpper_[i] - originalLower_[i] > 1.0)
    750759                continue; // skip as not 0-1
Note: See TracChangeset for help on using the changeset viewer.