/dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/ |
H A D | CglStored.cpp | 53 if (jColumn < number01) { in generateCuts() 54 jColumn = integerVariable[jColumn]; in generateCuts() 55 assert(jColumn >= 0); in generateCuts() 65 column[1] = jColumn; in generateCuts() 79 column[1] = jColumn; in generateCuts() 99 column[1] = jColumn; in generateCuts() 113 column[1] = jColumn; in generateCuts() 124 if (jColumn < number01) { in generateCuts() 125 jColumn = integerVariable[jColumn]; in generateCuts() 126 assert(jColumn >= 0); in generateCuts() [all …]
|
H A D | CglTreeInfo.cpp | 700 iColumn, jColumn, jColumn, iColumn); in analyze() 725 iColumn, jColumn, jColumn, iColumn); in analyze() 732 iColumn, jColumn, jColumn, iColumn); in analyze() 737 iColumn, jColumn, jColumn, iColumn); in analyze() 749 iColumn, jColumn, jColumn, iColumn); in analyze() 754 iColumn, jColumn, jColumn, iColumn); in analyze() 982 if (jColumn > iColumn && !mark[jColumn]) { in analyze() 1067 if (jColumn > iColumn && !mark[jColumn]) { in analyze() 1387 for (int jColumn = 0; jColumn < static_cast< int >(numberIntegers_); jColumn++) { in fixColumns() local 1537 for (int jColumn = 0; jColumn < static_cast< int >(numberIntegers_); jColumn++) { in packDown() local [all …]
|
/dports/math/py-CyLP/CyLP-0.91.4/cylp/cpp/ |
H A D | IClpPackedMatrix.cpp | 17 for (int jColumn=0;jColumn<number;jColumn++) { in transposeTimesSubsetAll() local 18 int iColumn = which[jColumn]; in transposeTimesSubsetAll() 36 for (int jColumn=0;jColumn<number;jColumn++) { in transposeTimesSubsetAll() local 37 int iColumn = which[jColumn]; in transposeTimesSubsetAll() 66 for (int jColumn=0;jColumn<number;jColumn++) { in transposeTimesSubsetAll() local 67 int iColumn = which[jColumn]; in transposeTimesSubsetAll()
|
/dports/math/ogdf/OGDF/src/coin/Clp/ |
H A D | ClpQuadraticObjective.cpp | 111 if (jColumn > iColumn) { in ClpQuadraticObjective() 152 … CoinBigIndex put = columnQuadraticLength2[jColumn] + columnQuadraticStart2[jColumn]; in ClpQuadraticObjective() 787 if (iColumn != jColumn) { in stepLength() 841 if (iColumn != jColumn) { in stepLength() 866 if (iColumn != jColumn) { in stepLength() 941 if (iColumn != jColumn) { in objectiveValue() 984 if (iColumn != jColumn) { in objectiveValue() 1003 if (iColumn != jColumn) { in objectiveValue() 1029 int jColumn = columnQuadratic[j]; in reallyScale() local 1048 int jColumn = columnQuadratic[j]; in markNonlinear() local [all …]
|
H A D | ClpConstraintQuadratic.cpp | 53 int jColumn = column_[j]; in ClpConstraintQuadratic() local 54 if (jColumn >= 0) { in ClpConstraintQuadratic() 56 mark[jColumn] = 1; in ClpConstraintQuadratic() 146 int jColumn = column_[j]; in gradient() local 147 if (jColumn >= 0) { in gradient() 244 int jColumn = column_[j]; in markNonlinear() local 245 if (jColumn >= 0) { in markNonlinear() 247 which[jColumn] = 1; in markNonlinear() 269 int jColumn = column_[j]; in markNonzero() local 270 if (jColumn >= 0) { in markNonzero() [all …]
|
/dports/math/clp/Clp-1.17.3/Clp/src/ |
H A D | ClpQuadraticObjective.cpp | 111 if (jColumn > iColumn) { in ClpQuadraticObjective() 150 if (jColumn > iColumn) { in ClpQuadraticObjective() 152 CoinBigIndex put = columnQuadraticLength2[jColumn] + columnQuadraticStart2[jColumn]; in ClpQuadraticObjective() 430 if (iColumn != jColumn) { in gradient() 777 if (iColumn != jColumn) { in stepLength() 831 if (iColumn != jColumn) { in stepLength() 856 if (iColumn != jColumn) { in stepLength() 930 if (iColumn != jColumn) { in objectiveValue() 973 if (iColumn != jColumn) { in objectiveValue() 992 if (iColumn != jColumn) { in objectiveValue() [all …]
|
H A D | ClpConstraintQuadratic.cpp | 53 int jColumn = column_[j]; in ClpConstraintQuadratic() local 54 if (jColumn >= 0) { in ClpConstraintQuadratic() 56 mark[jColumn] = 1; in ClpConstraintQuadratic() 144 int jColumn = column_[j]; in gradient() local 145 if (jColumn >= 0) { in gradient() 238 int jColumn = column_[j]; in markNonlinear() local 239 if (jColumn >= 0) { in markNonlinear() 241 which[jColumn] = 1; in markNonlinear() 262 int jColumn = column_[j]; in markNonzero() local 263 if (jColumn >= 0) { in markNonzero() [all …]
|
H A D | ClpPESimplex.cpp | 61 for (int jColumn = 0; jColumn < number; jColumn++) { in PEtransposeTimesSubsetAll() local 62 int iColumn = which[jColumn]; in PEtransposeTimesSubsetAll() 83 for (int jColumn = 0; jColumn < number; jColumn++) { in PEtransposeTimesSubsetAll() local 84 int iColumn = which[jColumn]; in PEtransposeTimesSubsetAll() 374 int jColumn; in identifyCompatibleCols() local 385 jColumn = which[j]; in identifyCompatibleCols() 387 jColumn = j; in identifyCompatibleCols() 391 isCompatibleCol_[jColumn] = false; in identifyCompatibleCols() 395 if (jColumn < numberColumns_) { in identifyCompatibleCols() 397 …for (CoinBigIndex i = columnStart[jColumn]; i < columnStart[jColumn] + columnLength[jColumn]; i++)… in identifyCompatibleCols() [all …]
|
H A D | CoinAbcBaseFactorization4.cpp | 46 get = startR[jColumn]; in getColumnSpaceIterateR() 48 startR[jColumn] = put; in getColumnSpaceIterateR() 55 jColumn = nextColumn[jColumn]; in getColumnSpaceIterateR() 438 smallestIndex=jColumn; 445 region[jColumn] = elementRowU[i]; 649 smallestIndex=jColumn; 794 scatter[jColumn].number=k; 815 numberInColumn[jColumn]=k; 848 if (jColumn==iColumn2) { 873 numberInColumn[jColumn]=k; [all …]
|
H A D | CoinAbcBaseFactorization1.cpp | 790 for (int jColumn = first; jColumn < last; jColumn++) { in pivotStartup() local 822 for (int jColumn = 0; jColumn < nDo; jColumn++) { in pivotWhile() local 834 for (int jColumn = 0; jColumn < nDo; jColumn++) { in pivotWhile() local 875 for (int jColumn = first; jColumn < last; jColumn++) { in pivotSomeAfter() local 993 for (int jColumn = first; jColumn < last; jColumn++) { in pivotSome() local 1265 for (int jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() local 1660 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++ ) { in pivot() 2014 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 2271 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 2299 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() [all …]
|
H A D | ClpSolver.cpp | 3115 for (int jColumn = 1; jColumn < numberSort; jColumn++) { local 3145 for (int jColumn = 1; jColumn < numberSort; jColumn++) { local 3174 for (int jColumn = 1; jColumn < numberSort + 1; jColumn++) { local 3175 if (jColumn == numberSort || fabs(obj[jColumn] - last) > 1.0e-12) { 3481 jColumn = kColumn; 3607 jColumn = nextColumn[jColumn]; 3822 for (int jColumn = 0; jColumn < nColumns; jColumn++) { local 3855 int jColumn = iColumn; local 4036 jColumn = backColumn[jColumn]; 4247 if (mapColumn[jColumn] != jColumn) { [all …]
|
/dports/math/osi/Osi-0.108.6/CoinUtils/test/ |
H A D | CoinModelTest.cpp | 124 int * column = new int[lastColumn[jColumn+1]-lastColumn[jColumn]]; in buildRandom() 125 double * element = new double[lastColumn[jColumn+1]-lastColumn[jColumn]]; in buildRandom() 168 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 222 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 244 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 260 iColumn>=lastColumn[jColumn]&&iColumn<lastColumn[jColumn+1]) in buildRandom() 279 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 295 iColumn>=lastColumn[jColumn]&&iColumn<lastColumn[jColumn+1]) in buildRandom() 308 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 355 for (int j=lastColumn[jColumn];j<lastColumn[jColumn+1];j++) { in buildRandom() [all …]
|
/dports/math/coinutils/CoinUtils-2.11.4/CoinUtils/test/ |
H A D | CoinModelTest.cpp | 124 int * column = new int[lastColumn[jColumn+1]-lastColumn[jColumn]]; in buildRandom() 125 double * element = new double[lastColumn[jColumn+1]-lastColumn[jColumn]]; in buildRandom() 168 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 222 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 244 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 260 iColumn>=lastColumn[jColumn]&&iColumn<lastColumn[jColumn+1]) in buildRandom() 279 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 295 iColumn>=lastColumn[jColumn]&&iColumn<lastColumn[jColumn+1]) in buildRandom() 308 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 355 for (int j=lastColumn[jColumn];j<lastColumn[jColumn+1];j++) { in buildRandom() [all …]
|
/dports/math/clp/Clp-1.17.3/CoinUtils/test/ |
H A D | CoinModelTest.cpp | 124 int * column = new int[lastColumn[jColumn+1]-lastColumn[jColumn]]; in buildRandom() 125 double * element = new double[lastColumn[jColumn+1]-lastColumn[jColumn]]; in buildRandom() 168 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 222 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 244 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 260 iColumn>=lastColumn[jColumn]&&iColumn<lastColumn[jColumn+1]) in buildRandom() 279 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 295 iColumn>=lastColumn[jColumn]&&iColumn<lastColumn[jColumn+1]) in buildRandom() 308 for (i=lastColumn[jColumn];i<lastColumn[jColumn+1];i++) { in buildRandom() 355 for (int j=lastColumn[jColumn];j<lastColumn[jColumn+1];j++) { in buildRandom() [all …]
|
/dports/math/osi/Osi-0.108.6/CoinUtils/src/ |
H A D | CoinFactorization.hpp | 1125 int jColumn; in pivot() local 1126 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1309 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1334 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1362 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1389 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1885 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { 2066 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { 2091 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { 2119 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { [all …]
|
/dports/math/coinutils/CoinUtils-2.11.4/CoinUtils/src/ |
H A D | CoinFactorization.hpp | 1125 int jColumn; in pivot() local 1126 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1309 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1334 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1362 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1389 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1885 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { 2066 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { 2091 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { 2119 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { [all …]
|
/dports/math/ogdf/OGDF/include/coin/ |
H A D | CoinFactorization.hpp | 892 for ( jColumn = 0; jColumn < numberInPivotRow; jColumn++ ) { in pivot() 1074 for ( jColumn = 0; jColumn < numberInPivotRow; jColumn++ ) { in pivot() 1099 for ( jColumn = 0; jColumn < numberInPivotRow; jColumn++ ) { in pivot() 1127 for ( jColumn = 0; jColumn < numberInPivotRow; jColumn++ ) { in pivot() 1154 for ( jColumn = 0; jColumn < numberInPivotRow; jColumn++ ) { in pivot() 1627 for ( jColumn = 0; jColumn < numberDoRow; jColumn++ ) { 1806 int jColumn; variable 1808 for ( jColumn = 0; jColumn < numberDoRow; jColumn++ ) { 1833 for ( jColumn = 0; jColumn < numberDoRow; jColumn++ ) { 1861 for ( jColumn = 0; jColumn < numberDoRow; jColumn++ ) { [all …]
|
/dports/math/clp/Clp-1.17.3/CoinUtils/src/ |
H A D | CoinFactorization.hpp | 1125 int jColumn; in pivot() local 1126 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1309 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1334 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1362 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1389 for (jColumn = 0; jColumn < numberInPivotRow; jColumn++) { in pivot() 1885 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { 2066 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { 2091 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { 2119 for (jColumn = 0; jColumn < numberDoRow; jColumn++) { [all …]
|
/dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/ |
H A D | CbcHeuristicGreedy.cpp | 239 for (int jColumn = 0; jColumn < numberLook; jColumn++) { in solution() local 240 int iColumn = which[jColumn]; in solution() 653 for (int jColumn = 0; jColumn < numberLook; jColumn++) { in solution() local 1114 jColumn = nextGub[jColumn]; in solution() 1263 for (int jColumn = 0; jColumn < numberColumns; jColumn++) { in solution() local 1413 jColumn = nextGub[jColumn]; in solution() 1564 jColumn = nextGub[jColumn]; in solution() 1569 j < columnStart[jColumn] + columnLength[jColumn]; j++) { in solution() 1611 assert(jColumn >= 0); in solution() 1615 jColumn = nextGub[jColumn]; in solution() [all …]
|
H A D | CbcSolverHeuristics.cpp | 511 CoinBigIndex put = fixColumn2[jColumn] + counts[jColumn]; in fixVubs() 512 counts[jColumn]++; in fixVubs() 722 for (CoinBigIndex k = fixColumn2[jColumn]; k < fixColumn2[jColumn + 1]; k++) { in fixVubs() 806 for (CoinBigIndex k = fixColumn2[jColumn]; k < fixColumn2[jColumn + 1]; k++) { in fixVubs() 850 state[jColumn] = 3; in fixVubs() 881 columnUpper[jColumn] = saveColumnUpper[jColumn]; in fixVubs() 882 state[jColumn] = -1; in fixVubs() 983 for (CoinBigIndex k = fixColumn2[jColumn]; k < fixColumn2[jColumn + 1]; k++) { in fixVubs() 1014 for (CoinBigIndex k = fixColumn2[jColumn]; k < fixColumn2[jColumn + 1]; k++) { in fixVubs() 1092 columnLower[jColumn] = CoinMax(columnLower[jColumn], newColumnLower[iColumn]); in fixVubs() [all …]
|
H A D | CbcSolverAnalyze.cpp | 89 int jColumn = column[j]; in analyze() local 91 if (upper[jColumn] > lower[jColumn] + 1.0e-8) { in analyze() 92 if (!solver->isInteger(jColumn)) { in analyze() 94 jColumn1 = jColumn; in analyze() 97 jColumn2 = jColumn; in analyze() 106 sumFixed += lower[jColumn] * value; in analyze()
|
H A D | CbcTree.cpp | 227 int jColumn = variables[i]; in addBranchingInformation() local 230 jColumn |= 0x40000000; in addBranchingInformation() 259 jColumn |= 0x80000000; in addBranchingInformation() 263 int jColumn = which[i]; in addBranchingInformation() local 264 … assert(currentLower[jColumn] == newLower[jColumn] || currentUpper[jColumn] == newUpper[jColumn]); in addBranchingInformation() 265 if (jColumn != iColumn) { in addBranchingInformation() 268 if (newLower[jColumn] > currentLower[jColumn]) { in addBranchingInformation() 269 value = newLower[jColumn]; in addBranchingInformation() 271 } else if (newUpper[jColumn] < currentUpper[jColumn]) { in addBranchingInformation() 272 value = newUpper[jColumn]; in addBranchingInformation() [all …]
|
H A D | CbcMipStartIO.cpp | 210 int jColumn = members[j]; in computeCompleteSolution() local 211 if (savedSol[jColumn]) in computeCompleteSolution() 212 iColumn = jColumn; in computeCompleteSolution() 215 int jColumn = members[j]; in computeCompleteSolution() local 216 if (jColumn != iColumn) { in computeCompleteSolution() 217 lp->setColLower(jColumn, 0.0); in computeCompleteSolution() 218 lp->setColUpper(jColumn, 0.0); in computeCompleteSolution() 226 int jColumn = members[j]; in computeCompleteSolution() local 227 if (savedSol[jColumn]) { in computeCompleteSolution() 243 int jColumn = members[j]; in computeCompleteSolution() local [all …]
|
/dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/CglGomory/ |
H A D | CglGomory.cpp | 1189 cutElement[jColumn]=0.0; 1194 if (!intVar[jColumn]) 1203 violation2 -= fabs(value*(colsol[jColumn]-colLower[jColumn])); 1209 violation2 -= fabs(value*(colsol[jColumn]-colUpper[jColumn])); 1404 int jColumn =cutIndex[j]; local 1406 std::cout<<"("<<jColumn<<","<<value<<","<<colsol[jColumn] 1418 int jColumn =cutIndex[j]; local 1420 std::cout<<"("<<jColumn<<","<<value<<","<<colsol[jColumn] 1670 int jColumn =cutIndex[j]; 1672 std::cout<<"("<<jColumn<<","<<value<<","<<colsol[jColumn] [all …]
|
/dports/math/cbc/Cbc-releases-2.10.5/Cbc/examples/ |
H A D | sudoku.cpp | 312 int jColumn = row * size + j; in main() local 313 int jjColumn = size * size + jColumn * size + i; in main() 320 int jColumn = j * size + column; in main() local 321 int jjColumn = size * size + jColumn * size + i; in main() 333 int jColumn = j * size + jc; in main() local 334 int jjColumn = size * size + jColumn * size + i; in main() 347 int jColumn = seq[kk]; in main() local 350 if (jColumn > kColumn) { in main() 351 cutInd[1] = jColumn; in main()
|