Changeset 2344 for trunk/Cbc/src/CbcHeuristic.cpp
- Timestamp:
- Sep 29, 2017 7:14:01 AM (3 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/Cbc/src/CbcHeuristic.cpp
r2341 r2344 2097 2097 memset(rowActivity, 0, numberRows*sizeof(double)); 2098 2098 for (i = 0; i < numberColumns; i++) { 2099 intj;2099 CoinBigIndex j; 2100 2100 double value = newSolution[i]; 2101 2101 if (value < lower[i]) { … … 2151 2151 newSolution[iColumn] = newValue; 2152 2152 newSolutionValue += move * cost; 2153 intj;2153 CoinBigIndex j; 2154 2154 for (j = columnStart[iColumn]; 2155 2155 j < columnStart[iColumn] + columnLength[iColumn]; j++) { … … 2173 2173 // maybe put in coding for multiple slacks? 2174 2174 double bestCost = 1.0e50; 2175 intk;2175 CoinBigIndex k; 2176 2176 int iBest = -1; 2177 2177 double addCost = 0.0; … … 2261 2261 double lowerValue = lower[iColumn]; 2262 2262 double upperValue = upper[iColumn]; 2263 intj;2263 CoinBigIndex j; 2264 2264 int anyBadDown = 0; 2265 2265 int anyBadUp = 0; … … 2409 2409 double lowerValue = lower[iColumn]; 2410 2410 double upperValue = upper[iColumn]; 2411 intj;2411 CoinBigIndex j; 2412 2412 int anyBadDown = 0; 2413 2413 int anyBadUp = 0; … … 2627 2627 } else { 2628 2628 // see if we can move 2629 intj;2629 CoinBigIndex j; 2630 2630 for (j = columnStart[iColumn]; 2631 2631 j < columnStart[iColumn] + columnLength[iColumn]; j++) { … … 2641 2641 newSolution[iColumn] = newValue; 2642 2642 newSolutionValue += move * cost; 2643 intj;2643 CoinBigIndex j; 2644 2644 for (j = columnStart[iColumn]; 2645 2645 j < columnStart[iColumn] + columnLength[iColumn]; j++) { … … 2666 2666 memset(rowActivity, 0, numberRows*sizeof(double)); 2667 2667 for (i = 0; i < numberColumns; i++) { 2668 intj;2668 CoinBigIndex j; 2669 2669 double value = newSolution[i]; 2670 2670 if (value) {
Note: See TracChangeset
for help on using the changeset viewer.